Article ID: | iaor20021713 |
Country: | United Kingdom |
Volume: | 4 |
Issue: | 2 |
Start Page Number: | 105 |
End Page Number: | 121 |
Publication Date: | Mar 2001 |
Journal: | Journal of Scheduling |
Authors: | Sourd Francis, Nuijten Wim |
This paper discusses scheduling problems that combine tails and deadlines or, equivalently, due dates and deadlines. This approach is illustrated to be of practical interest to strengthen some lower bounds in shop scheduling problems. We show that both deadlines and tails can efficiently be modelled via a non-decreasing cost function of the completion time so that we can use the