Journal of the Operational Research Society

, Volume 64, Issue 12, pp 1851–1864 | Cite as

Minimizing maximum lateness of jobs in inventory constrained scheduling

General Paper

Abstract

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.

Keywords

machine scheduling inventory constraints branch and bound minimization of maximum lateness 

References

  1. Bartels J-H and Zimmermann J (2009). Scheduling tests in automotive R&D projects. European Journal of Operational Research 193 (3): 805–819.CrossRefGoogle Scholar
  2. Boysen N (2010). Truck scheduling at zero-inventory cross docking terminals. Computers & Operations Research 37 (1): 32–41.CrossRefGoogle Scholar
  3. Boysen N and Fliedner M (2010). Cross dock scheduling: Classification, literature review and research agenda. Omega 38 (6): 413–422.CrossRefGoogle Scholar
  4. Boysen N, Fliedner M and Scholl A (2010). Scheduling inbound and outbound trucks at cross docking terminals. OR Spectrum 32 (1): 135–161.CrossRefGoogle Scholar
  5. 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
  6. Briskorn D, Choi B-C, Lee K, Leung J and Pinedo M (2010). Complexity of single machine scheduling subject to nonnegative inventory constraints. European Journal of Operational Research 207 (2): 605–619.CrossRefGoogle Scholar
  7. 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
  8. Chen F and Lee C-Y (2009). Minimizing the makespan in a two-machine cross-docking flowshop problem. European Journal of Operational Research 193 (1): 59–72.CrossRefGoogle Scholar
  9. Chen F and Song K (2009). Minimizing makespan in two-stage hybrid cross docking scheduling problem. Computers & Operations Research 36 (6): 2066–2073.CrossRefGoogle Scholar
  10. Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5: 287–326.CrossRefGoogle Scholar
  11. Lawler E (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science 19 (5): 544–546.CrossRefGoogle Scholar
  12. Martello S, Pisinger D and Toth P (1999). Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science 45 (3): 414–424.CrossRefGoogle Scholar
  13. Martello S, Pisinger D and Toth P (2000). New trends in exact algorithms for the 0-1 knapsack problem. European Journal of Operational Research 123 (3): 325–332.CrossRefGoogle Scholar
  14. McWilliams DL, Stanfield PM and Geiger CD (2005). The parcel hub scheduling problem: A simulation-based solution approach. Computers & Industrial Engineering 49 (3): 393–412.CrossRefGoogle Scholar
  15. Neumann K and Schwindt C (2002). Project scheduling with inventory constraints. Mathematical Methods of Operations Research 56 (3): 513–533.CrossRefGoogle Scholar
  16. Neumann K, Schwindt C and Trautmann N (2005). Scheduling of continuous and discontinuous material flows with intermediate storage restrictions. European Journal of Operational Research 165 (2): 495–509.CrossRefGoogle Scholar
  17. Pisinger D (2005). Where are the hard knapsack problems? Computers & Operations Research 32 (9): 2271–2284.CrossRefGoogle Scholar
  18. Schwindt C and Trautmann N (2000). Batch scheduling in process industries: An application of resource-constrained project scheduling. OR Spectrum 22 (4): 501–524.CrossRefGoogle Scholar
  19. Yu W and Egbelu PJ (2008). Scheduling of inbound and outbound trucks in cross docking systems with temporary storage. European Journal of Operational Research 184 (1): 377–396.CrossRefGoogle Scholar

Copyright information

© Operational Research Society 2013

Authors and Affiliations

  1. 1.Universität SiegenSiegenGermany
  2. 2.University HeightsNewarkUSA

Personalised recommendations