A POSSIBILITY LINEAR PROGRAMMING APPROACH TO SOLVE A FUZZY SINGLE MACHINE SCHEDULING PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NAKHAEI KAMALABADI I.; MIRZAEI A.H.; JAVADI B.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Industrial and Systems Engineering Year:2007 | Volume:1 | Issue:2 Page(s): 116-129

Download Full-Text

View:

309

Download:

131

Cites:

Information Journal Paper

Title

A POSSIBILITY LINEAR PROGRAMMING APPROACH TO SOLVE A FUZZY SINGLE MACHINE SCHEDULING PROBLEM

Author(s)

NAKHAEI KAMALABADI I. | MIRZAEI A.H. | JAVADI B. | Issue Writer Certificate

Keywords

SINGLE MACHINE SCHEDULING

EARLINESS / TARDINESS

POSSIBILITY LINEAR PROGRAMMING

PARTICLE SWARM OPTIMIZATION

Abstract

This paper employs an interactive POSSIBILITY LINEAR PROGRAMMING approach to solve a SINGLE MACHINE SCHEDULING problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and minimizing the risk of obtaining higher total costs simultaneously. This approach is applicable to just-in-time systems, in which many firms face the need to complete jobs as close as possible to their due dates. The objective of the model is to minimize the total costs of earliness/tardiness penalties. In this paper, the proposed POSSIBILITY LINEAR PROGRAMMING approach is applied to a fuzzy SINGLE MACHINE SCHEDULING problem with respect to the overall degree of decision maker satisfaction. Due to the proposed model’s complexity, conventional optimization methods cannot be utilized in reasonable time. Hence, the PARTICLE SWARM OPTIMIZATION method is applied toward its solution.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

NAKHAEI KAMALABADI, I., MIRZAEI, A.H., & JAVADI, B.. (2007). A POSSIBILITY LINEAR PROGRAMMING APPROACH TO SOLVE A FUZZY SINGLE MACHINE SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), 1(2), 116-129. SID. https://sid.ir/paper/307053/en

Vancouver: Copy

NAKHAEI KAMALABADI I., MIRZAEI A.H., JAVADI B.. A POSSIBILITY LINEAR PROGRAMMING APPROACH TO SOLVE A FUZZY SINGLE MACHINE SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE)[Internet]. 2007;1(2):116-129. Available from: https://sid.ir/paper/307053/en

IEEE: Copy

I. NAKHAEI KAMALABADI, A.H. MIRZAEI, and B. JAVADI, “A POSSIBILITY LINEAR PROGRAMMING APPROACH TO SOLVE A FUZZY SINGLE MACHINE SCHEDULING PROBLEM,” JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), vol. 1, no. 2, pp. 116–129, 2007, [Online]. Available: https://sid.ir/paper/307053/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops