A GENETIC ALGORITHM FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS PENALTIES WITH CONSIDERATION OF PREEMPTION AND IDLE TIME

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.

FAKHRZAD MOHAMMAD BAGHER; AZIMZADEH MEHDI

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

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2012 | Volume:3 | Issue:1 (4) Page(s): 65-78

Download Full-Text

Persian Verion

View:

1,357

Download:

Cites:

Information Journal Paper

Title

A GENETIC ALGORITHM FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS PENALTIES WITH CONSIDERATION OF PREEMPTION AND IDLE TIME

Author(s)

FAKHRZAD MOHAMMAD BAGHER | AZIMZADEH MEHDI | Issue Writer Certificate

Keywords

SINGLE MACHINEQ2

GENETIC ALGORITHMQ2

LINEAR EARLINESSQ2

QUADRATIC TARDINESSQ2

MACHINE IDLE TIME AND PREEMPTIONQ2

Abstract

In this paper, a non linear mathematical model has been proposed for solving a SINGLE MACHINE scheduling problem with a LINEAR EARLINESS and QUADRATIC TARDINESS cost, where MACHINE IDLE TIME AND PREEMPTIONs are allowed. As the model is complex and cannot be solved in polynomial time, it has been assumed to be a NP hard problem, so the known optimal solution methods may not be applicable for its solution. A GENETIC ALGORITHM approach has been developed for solving the model and numerical examples has been presented, which imply that the proposed method is efficient and effective.

Cites

No record.

References

No record.

Cite

APA: Copy

FAKHRZAD, MOHAMMAD BAGHER, & AZIMZADEH, MEHDI. (2012). A GENETIC ALGORITHM FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS PENALTIES WITH CONSIDERATION OF PREEMPTION AND IDLE TIME. PRODUCTION AND OPERATIONS MANAGEMENT, 3(1 (4)), 65-78. SID. https://sid.ir/paper/217531/en

Vancouver: Copy

FAKHRZAD MOHAMMAD BAGHER, AZIMZADEH MEHDI. A GENETIC ALGORITHM FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS PENALTIES WITH CONSIDERATION OF PREEMPTION AND IDLE TIME. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2012;3(1 (4)):65-78. Available from: https://sid.ir/paper/217531/en

IEEE: Copy

MOHAMMAD BAGHER FAKHRZAD, and MEHDI AZIMZADEH, “A GENETIC ALGORITHM FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS PENALTIES WITH CONSIDERATION OF PREEMPTION AND IDLE TIME,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 3, no. 1 (4), pp. 65–78, 2012, [Online]. Available: https://sid.ir/paper/217531/en

Related Journal Papers