| Article ID: | iaor20011782 |
| Country: | Netherlands |
| Volume: | 126 |
| Issue: | 3 |
| Start Page Number: | 557 |
| End Page Number: | 566 |
| Publication Date: | Nov 2000 |
| Journal: | European Journal of Operational Research |
| Authors: | Janiak Adam, Bachman Aleksander |
The paper deals with a single machine scheduling problem, where job processing time is given as a start time dependent linear function. The objective is to find such a schedule (processing order) which minimizes the maximum lateness criterion. We show that the problem is NP-complete and present two heuristic algorithms. An experimental analysis of the proposed algorithms is also given.