Memetic algorithm for non-identical parallel machines scheduling problem with earliness and tardiness penalties Online publication date: Thu, 27-Nov-2014
by Wisut Supithak, Karn Plongon
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 22, No. 1, 2011
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Technology and Management (IJMTM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook