Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

  • Rico Walter

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

Registered author(s):

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://link.springer.com/content/pdf/10.1007%2Fs10100-011-0217-4
    Download Restriction: no

    Bibliographic Info

    Paper provided by Friedrich-Schiller-University Jena, School of Economics and Business Administration in its series Jena Research Papers in Business and Economics - Working and Discussion Papers with number 13/2010.

    as in new window
    Length:
    Date of creation: 11 Jul 2010
    Date of revision:
    Publication status: Published in: Central European Journal of Operations Research 21/1 (2013), 125-139.
    Handle: RePEc:jen:jenjbe:2010-13

    Contact details of provider:
    Postal: Carl-Zeiss-Strasse 3, 07743 JENA
    Phone: +049 3641/ 9 43000
    Fax: +049 3641/ 9 43000
    Web page: http://www.wiwi.uni-jena.de/
    More information through EDIRC

    Order Information:
    Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.

    Related research

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

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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: ().

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.