A sequential exchange approach for minimizing earliness–tardiness penalties of single-machine scheduling with a common due date

A sequential exchange approach for minimizing earliness–tardiness penalties of single-machine scheduling with a common due date

0.00 Avg rating0 Votes
Article ID: iaor20084391
Country: Netherlands
Volume: 177
Issue: 2
Start Page Number: 1294
End Page Number: 1301
Publication Date: Mar 2007
Journal: European Journal of Operational Research
Authors: , ,
Keywords: heuristics
Abstract:

This study focuses on a class of single-machine scheduling problems with a common due date where the objective is to minimize the total earliness–tardiness penalty for the jobs. A sequential exchange approach utilizing a job exchange procedure and three previously established properties in common due date scheduling was developed and tested with a set of benchmark problems. The developed approach generates results better than not only those of the existing dedicated heuristics but also in many cases those of meta-heuristic approaches. And the developed approach performs consistently well in various job settings with respect to the number of jobs, processing time and earliness–tardiness penalties for the jobs.

Reviews

Required fields are marked *. Your email address will not be published.