Minimizing maximum lateness of jobs in inventory constrained scheduling

D. Briskorn, J. Y.T. Leung

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)1851-1864
Number of pages14
JournalJournal of the Operational Research Society
Issue number12
StatePublished - Dec 2013

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing


  • Branch and bound
  • Inventory constraints
  • Machine scheduling
  • Minimization of maximum lateness


Dive into the research topics of 'Minimizing maximum lateness of jobs in inventory constrained scheduling'. Together they form a unique fingerprint.

Cite this