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

On the Minimization of the Makespan Subject to Flowtime Optimality

Author

Listed:
  • Brian Thomas Eck

    (Juran Institute, Inc., Wilton, Connecticut)

  • Michael Pinedo

    (Columbia University, New York, New York)

Abstract

When scheduling n jobs on m identical machines in parallel, two performance criteria are of particular interest: the makespan (the completion time of the last job) and the flowtime (the sum of the completion times of all n jobs). Whereas minimizing makespan is NP-hard, many schedules minimize flowtime, and they are easy to characterize. This paper considers the problem of minimizing the makespan among flowtime-optimal schedules. Heuristics have appeared in the literature that result in flowtime-optimal schedules with makespans which are always less than or equal to 5/4 times the minimum flowtime-optimal makespan. In this note, we present new heuristics for this problem, one of which yields a worst-case bound of 28/27 for the two-machine case. The new heuristics have a running time of O ( n log n ). Extensions are discussed for general m .

Suggested Citation

  • Brian Thomas Eck & Michael Pinedo, 1993. "On the Minimization of the Makespan Subject to Flowtime Optimality," Operations Research, INFORMS, vol. 41(4), pages 797-801, August.
    • Handle: RePEc:inm:oropre:v:41:y:1993:i:4:p:797-801
    DOI: 10.1287/opre.41.4.797
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.4.797
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.41.4.797?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. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    2. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2023. "Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time," European Journal of Operational Research, Elsevier, vol. 305(2), pages 594-607.
    3. Peruvemba Sundaram Ravi & Levent Tunçel & Michael Huang, 2016. "Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime," Journal of Scheduling, Springer, vol. 19(5), pages 547-561, October.
    4. Hesaraki, Alireza F. & Dellaert, Nico P. & de Kok, Ton, 2019. "Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan," European Journal of Operational Research, Elsevier, vol. 275(1), pages 304-318.
    5. Myungho Lee & Kangbok Lee & Michael Pinedo, 2022. "Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs," Journal of Scheduling, Springer, vol. 25(6), pages 721-740, December.
    6. Gupta, Jatinder N. D. & Ruiz-Torres, Alex J., 2000. "Minimizing makespan subject to minimum total flow-time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 125(2), pages 370-380, September.
    7. Lin, Yang-Kuei & Fowler, John W. & Pfund, Michele E., 2013. "Multiple-objective heuristics for scheduling unrelated parallel machines," European Journal of Operational Research, Elsevier, vol. 227(2), pages 239-253.
    8. R-H Huang & C-L Yang & H-T Huang, 2010. "Parallel machine scheduling with common due windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 640-646, April.
    9. Qian, Fubin & Strusevich, Vitaly & Gribkovskaia, Irina & Halskau, Øyvind, 2015. "Minimization of passenger takeoff and landing risk in offshore helicopter transportation: Models, approaches and analysis," Omega, Elsevier, vol. 51(C), pages 93-106.

    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:41:y:1993:i:4:p:797-801. 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.