Minimizing maximum lateness of jobs in inventory constrained scheduling
- 31 Downloads
This paper focuses on a machine scheduling problem having applications in truck scheduling at transshipment terminals. Jobs increase and decrease, respectively, the level of a central inventory. Naturally, jobs decreasing the inventory level can be processed only if the level of the inventory is high enough not to drop below zero. We consider the problem to find a schedule for jobs such that the maximum lateness among all jobs is minimized. We develop properties of optimal solutions, lower bounds, and heuristic methods in order to find upper bounds. These are incorporated in four branch and bound algorithms that are based on fixing sequences of jobs in forward or backward direction in two different types of representations. By means of a computational study, we compare these approaches with each other in order to show their efficiency.
Keywordsmachine scheduling inventory constraints branch and bound minimization of maximum lateness
- Briskorn D, Choi B-C, Lee K, Leung J and Pinedo M (2009). Genetic algorithms for inventory constrained scheduling on a single machine. Working Paper. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No 649.Google Scholar
- Briskorn D, Jaehn F and Pesch E (2011). Exact algorithms for inventory constrained scheduling on a single machine. Journal of Scheduling, published online 20 December, doi: 10.1007/s10951-011-0261-x.Google Scholar