Article ID: | iaor19971362 |
Country: | United Kingdom |
Volume: | 47 |
Issue: | 10 |
Start Page Number: | 1280 |
End Page Number: | 1285 |
Publication Date: | Oct 1996 |
Journal: | Journal of the Operational Research Society |
Authors: | Pappis Costas P., Adamopoulos George I. |
In this paper, a set of jobs is scheduled using the slack time due-date determination method, according to which all the jobs are given the same flow allowance. The single machine case is considered. The objective function is a cost function including three components, namely flow allowance and weighted earliness and tardiness. An analytical solution is given and an algorithm, which provides optimal solutions, is presented. Finally, the parallel machines case is discussed.