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.
Original language | English |
---|---|
Pages (from-to) | 1294-1301 |
Number of pages | 8 |
Journal | European Journal of Operational Research |
Volume | 177 |
Issue number | 2 |
DOIs | |
State | Published - 01 03 2006 |
Externally published | Yes |
Keywords
- Common due date
- Earliness-tardiness penalties
- Heuristics
- Scheduling
- Single-machine