IDEAS home Printed from https://ideas.repec.org/p/jen/jenjbe/2010-13.html
   My bibliography  Save this paper

Comparing the minimum completion times of two longest-first scheduling-heuristics

Author

Listed:
  • Rico Walter

    () (Faculty of Economics and Business Administration, Friedrich Schiller University Jena)

Abstract

For the basic problem of non-preemptively scheduling n independent jobs on m identical parallel machines so that the minimum (or earliest) machine completion time is maximized, we compare the performance relationship between two well-known longest-first heuristics - the LPT- (longest processing time) and the RLPT-heuristic (restricted LPT). We provide insights into the solution structure of these two sequencing heuristics and prove that the minimum completion time of the LPT-schedule is at least as long as the minimum completion time of the RLPT-schedule. Furthermore, we show that the minimum completion time of the RLPT-heuristic always remains within a factor of 1/m of the optimal minimum completion time. The paper finishes with a comprehensive experimental study of the probabilistic behavior of RLPT-schedules compared to LPT-schedules in the two-machine case.

Suggested Citation

  • Rico Walter, 2017. "Comparing the minimum completion times of two longest-first scheduling-heuristics," Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) 13/2010, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
  • Handle: RePEc:jen:jenjbe:2010-13
    as

    Download full text from publisher

    File URL: http://link.springer.com/content/pdf/10.1007%2Fs10100-011-0217-4
    Download Restriction: no

    More about this item

    Keywords

    Scheduling - Identical parallel machines - Heuristics - Minimum completion time - Worst-case analysis;

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:jen:jenjbe:2010-13. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (). General contact details of provider: http://www.wiwi.uni-jena.de/ .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.