IDEAS home Printed from https://ideas.repec.org/a/igg/joris0/v6y2015i1p19-29.html
   My bibliography  Save this article

Minimizing Makespan on Identical Parallel Machines

Author

Listed:
  • Abey Kuruvilla

    (Department of Business, University of Wisconsin-Parkside, Kenosha, WI, USA)

  • Giuseppe Paletta

    (Dipartimento di Economia e Statistica, Università della Calabria, Cosenza, Italy)

Abstract

A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructed by using the current solution is developed to solve a classical multiprocessor scheduling problem with the objective of minimizing the makespan. Computational results indicate that the proposed algorithm is very competitive with respect to well-known constructive algorithms for a large number of benchmark instances.

Suggested Citation

  • Abey Kuruvilla & Giuseppe Paletta, 2015. "Minimizing Makespan on Identical Parallel Machines," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 6(1), pages 19-29, January.
    • Handle: RePEc:igg:joris0:v:6:y:2015:i:1:p:19-29
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijoris.2015010102
    Download Restriction: no
    ---><---

    More about this item

    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:igg:joris0:v:6:y:2015:i:1:p:19-29. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.