| Article ID: | iaor1996505 |
| Country: | United States |
| Volume: | 42 |
| Issue: | 7 |
| Start Page Number: | 1109 |
| End Page Number: | 1114 |
| Publication Date: | Oct 1995 |
| Journal: | Naval Research Logistics |
| Authors: | Szwarc Wlodzimierz, Mukhopadhyay Samar K. |
The article deals with a single machine earliness-tardiness scheduling model where idle times are permitted in job processing. Based on a cluster concept we develop properties of the model that lead to a very fast algorithm to find an optimal timing schedule for a given sequence of jobs. The performance of this algorithm is tested on 480 randomly generated problems involving 100, 200, 400 and 500 jobs. It takes less than two seconds to solve a 500 job problem on a PC.