Welcome to the InfoSci Platform
Reference Hub4
Minimizing Makespan on Identical Parallel Machines

Minimizing Makespan on Identical Parallel Machines

Abey Kuruvilla, Giuseppe Paletta
Copyright: © 2015 |Volume: 6 |Issue: 1 |Pages: 11
ISSN: 1947-9328|EISSN: 1947-9336|EISBN13: 9781466677999|DOI: 10.4018/ijoris.2015010102
Cite Article Cite Article

MLA

Kuruvilla, Abey, and Giuseppe Paletta. "Minimizing Makespan on Identical Parallel Machines." IJORIS vol.6, no.1 2015: pp.19-29. http://doi.org/10.4018/ijoris.2015010102

APA

Kuruvilla, A. & Paletta, G. (2015). Minimizing Makespan on Identical Parallel Machines. International Journal of Operations Research and Information Systems (IJORIS), 6(1), 19-29. http://doi.org/10.4018/ijoris.2015010102

Chicago

Kuruvilla, Abey, and Giuseppe Paletta. "Minimizing Makespan on Identical Parallel Machines," International Journal of Operations Research and Information Systems (IJORIS) 6, no.1: 19-29. http://doi.org/10.4018/ijoris.2015010102

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.