IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v64y2013i12p1851-1864.html
   My bibliography  Save this article

Minimizing maximum lateness of jobs in inventory constrained scheduling

Author

Listed:
  • D Briskorn

    (Universit&aauml;t Siegen, Siegen, Germany)

  • J Y-T Leung

    (University Heights, Newark, NJ, USA)

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.

Suggested Citation

  • D Briskorn & J Y-T Leung, 2013. "Minimizing maximum lateness of jobs in inventory constrained scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(12), pages 1851-1864, December.
    • Handle: RePEc:pal:jorsoc:v:64:y:2013:i:12:p:1851-1864
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n12/pdf/jors2012155a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v64/n12/full/jors2012155a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gehring, Marco & Volk, Rebekka & Schultmann, Frank, 2022. "On the integration of diverging material flows into resource‐constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1071-1087.
    2. Davari, Morteza & Ranjbar, Mohammad & De Causmaecker, Patrick & Leus, Roel, 2020. "Minimizing makespan on a single machine with release dates and inventory constraints," European Journal of Operational Research, Elsevier, vol. 286(1), pages 115-128.
    3. Jaehn, Florian, 2024. "Scheduling with jobs at fixed positions," European Journal of Operational Research, Elsevier, vol. 318(2), pages 388-397.
    4. Rupp, Johannes & Boysen, Nils & Briskorn, Dirk, 2022. "Optimizing consolidation processes in hubs: The hub-arrival-departure problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1051-1066.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:64:y:2013:i:12:p:1851-1864. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.