Minimizing Makespan on Identical Parallel Machines

Abey Kuruvilla and Giuseppe Paletta
Additional contact information
Abey Kuruvilla: Department of Business, University of Wisconsin-Parkside, Kenosha, WI, USA
Giuseppe Paletta: Dipartimento di Economia e Statistica, Università della Calabria, Cosenza, Italy

International Journal of Operations Research and Information Systems (IJORIS), 2015, vol. 6, issue 1, 19-29

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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 18/ijoris.2015010102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:joris0:v:6:y:2015:i:1:p:19-29

Access Statistics for this article

International Journal of Operations Research and Information Systems (IJORIS) is currently edited by John Wang

More articles in International Journal of Operations Research and Information Systems (IJORIS) from IGI Global
Bibliographic data for series maintained by Journal Editor ().