Article ID: | iaor19952099 |
Country: | United Kingdom |
Volume: | 22 |
Issue: | 8 |
Start Page Number: | 857 |
End Page Number: | 869 |
Publication Date: | Oct 1995 |
Journal: | Computers and Operations Research |
Authors: | Lee C.Y., Choi J.Y. |
Keywords: | heuristics |
A job scheduling problem with distinct due dates in a single machine is considered. General penalty weights which are not necessarily proportional to the processing times are applied to jobs either early or tardy. An optimal timing algorithm is presented which decides the optimal starting time of each job in a given job sequence. Idle times are inserted between blocks of jobs such that the cost function of each newly created job block is minimized. Prominent near optimal sequences are generated via a genetic algorithm