Minimizing maximum lateness of jobs in inventory constrained scheduling

D Briskorn and J Y-T Leung
Additional contact information
D Briskorn: Universit&aauml;t Siegen, Siegen, Germany
J Y-T Leung: University Heights, Newark, NJ, USA

Journal of the Operational Research Society, 2013, vol. 64, issue 12, 1851-1864

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.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v64/n12/pdf/jors2012155a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v64/n12/full/jors2012155a.html Link to full text HTML (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:64:y:2013:i:12:p:1851-1864

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().