IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v19y2016i5d10.1007_s10951-015-0467-4.html
   My bibliography  Save this article

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime

Author

Listed:
  • Peruvemba Sundaram Ravi

    (School of Business and Economics, Wilfrid Laurier University)

  • Levent Tunçel

    (University of Waterloo)

  • Michael Huang

Abstract

In 1976, Coffman and Sethi conjectured that a natural extension of LPT list scheduling to the bicriteria scheduling problem of minimizing makespan over flowtime-optimal schedules, called the LD algorithm, has a simple worst-case performance bound: $$\frac{5m-2}{4m-1}$$ 5 m - 2 4 m - 1 , where m is the number of machines. We study the structure of potential minimal counterexamples to this conjecture, provide some new tools and techniques for the analysis of such algorithms, and prove that to verify the conjecture, it suffices to analyze the following case: for every $$m \ge 4$$ m ≥ 4 , $$n \in \{4m, 5m\}$$ n ∈ { 4 m , 5 m } , where n is the number of jobs.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jsched:v:19:y:2016:i:5:d:10.1007_s10951-015-0467-4
    DOI: 10.1007/s10951-015-0467-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-015-0467-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-015-0467-4?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
    ---><---

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

    References listed on IDEAS

    as
    1. E. G. Coffman & M. Yannakakis, 1984. "Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 384-390, August.
    2. 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.
    3. Johnny C. Ho & Johnny S. Wong, 1995. "Makespan minimization for m parallel identical processors," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 935-948, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hofert Marius & Memartoluie Amir & Saunders David & Wirjanto Tony, 2017. "Improved algorithms for computing worst Value-at-Risk," Statistics & Risk Modeling, De Gruyter, vol. 34(1-2), pages 13-31, June.
    2. 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.
    3. Jose Blanchet & Henry Lam & Yang Liu & Ruodu Wang, 2020. "Convolution Bounds on Quantile Aggregation," Papers 2007.09320, arXiv.org, revised May 2023.
    4. Vairaktarakis, George L. & Cai, Xiaoqiang & Lee, Chung-Yee, 2002. "Workforce planning in synchronous production systems," European Journal of Operational Research, Elsevier, vol. 136(3), pages 551-572, February.
    5. Takaaki Koike & Liyuan Lin & Ruodu Wang, 2022. "Joint mixability and notions of negative dependence," Papers 2204.11438, arXiv.org, revised Jan 2024.
    6. Liao, Ching-Jong & Lin, Chien-Hung, 2003. "Makespan minimization for two uniform parallel machines," International Journal of Production Economics, Elsevier, vol. 84(2), pages 205-213, May.
    7. Navid Hashemian & Claver Diallo & Béla Vizvári, 2014. "Makespan minimization for parallel machines scheduling with multiple availability constraints," Annals of Operations Research, Springer, vol. 213(1), pages 173-186, February.
    8. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    9. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    10. C-J Liao & C-M Chen & C-H Lin, 2007. "Minimizing makespan for two parallel machines with job limit on each availability interval," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 938-947, July.
    11. 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.
    12. Liao, Ching-Jong & Shyur, Der-Lin & Lin, Chien-Hung, 2005. "Makespan minimization for two parallel machines with an availability constraint," European Journal of Operational Research, Elsevier, vol. 160(2), pages 445-456, January.
    13. Giovanni Puccetti & Pietro Rigo & Bin Wang & Ruodu Wang, 2019. "Centers of probability measures without the mean," Journal of Theoretical Probability, Springer, vol. 32(3), pages 1482-1501, September.
    14. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    15. 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.
    16. 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.
    17. 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.
    18. Carole Bernard & Oleg Bondarenko & Steven Vanduffel, 2018. "Rearrangement algorithm and maximum entropy," Annals of Operations Research, Springer, vol. 261(1), pages 107-134, February.
    19. Kris Boudt & Edgars Jakobsons & Steven Vanduffel, 2018. "Block rearranging elements within matrix columns to minimize the variability of the row sums," 4OR, Springer, vol. 16(1), pages 31-50, March.
    20. Carole Bernard & Don McLeish, 2016. "Algorithms for Finding Copulas Minimizing Convex Functions of Sums," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-26, October.

    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:spr:jsched:v:19:y:2016:i:5:d:10.1007_s10951-015-0467-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.springer.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.