Memetic algorithm for non-identical parallel machines scheduling problem with earliness and tardiness penalties

Wisut Supithak and Karn Plongon

International Journal of Manufacturing Technology and Management, 2011, vol. 22, issue 1, 26-38

Abstract: We consider the problem of determining the production schedule of n jobs on m non-identical parallel machines so that the sum of earliness and tardiness penalties is minimised. In the problem, each job has its own due date, earliness penalty, and tardiness penalty. To reduce the size of possible solution set, the problem is reduced to the job sequencing problem. The evolutionary procedures are developed, as the search in the global optimisation phase, to properly assign jobs to each machine and determine job sequence. In the local optimisation phase, the optimal timing algorithm is applied to determine the best schedule of each job sequence. In order to evaluate the performance of the memetic algorithm (MA) at different penalty cost rate and problem size, the solution from the heuristic is compared with the optimal solution obtained from the simple branch and bound method. The results show that the MA is promising.

Keywords: memetic algorithms; parallel machine scheduling; non-identical machines; earliness; tardiness. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=38481 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmtma:v:22:y:2011:i:1:p:26-38

Access Statistics for this article

More articles in International Journal of Manufacturing Technology and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().