IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i5p972-985.html
   My bibliography  Save this article

Minimizing Job Idleness in Deadline Constrained Environments

Author

Listed:
  • Reza H. Ahmadi

    (University of California, Los Angeles, California)

  • Uttarayan Bagchi

    (The University of Texas at Austin, Austin, Texas)

Abstract

The paper presents a formulation of an n -job, m -machine flowshop problem whose objective is to determine a processing sequence of jobs that minimizes total job idleness subject to meeting job deadlines. A mirror image problem is defined with the property that there is a one-to-one correspondence between the feasible schedules of the original problem and the feasible schedules of the mirror image problem. The mirror image problem is a traditional scheduling problem with a regular performance measure, whereas the performance measure in the original problem is not regular. The equivalence of the original problem and its mirror image problem enables us to solve one by solving the other. One special case of the original problem is investigated. It concerns minimization of total job idleness in a 2-machine flowshop. For this NP-hard problem we study permutation schedules under sufficient conditions of feasibility. We present complexity results, dominance properties, bounding criteria, and computational experience with a branch-and-bound procedure.

Suggested Citation

  • Reza H. Ahmadi & Uttarayan Bagchi, 1992. "Minimizing Job Idleness in Deadline Constrained Environments," Operations Research, INFORMS, vol. 40(5), pages 972-985, October.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:5:p:972-985
    DOI: 10.1287/opre.40.5.972
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.5.972
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.5.972?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Reza Ahmadi & Uttarayan Bagchi & Thomas A. Roemer, 2005. "Coordinated scheduling of customer orders for quick response," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 493-512, September.
    2. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.

    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:inm:oropre:v:40:y:1992:i:5:p:972-985. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.