Skip to content
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Publication Details
AFRICAN RESEARCH NEXUS
SHINING A SPOTLIGHT ON AFRICAN RESEARCH
business, management and accounting
Tight bounds for the identical parallel machine scheduling problem
International Transactions in Operational Research, Volume 13, No. 6, Year 2006
Notification
URL copied to clipboard!
Description
We address the problem of minimizing makespan on identical parallel machines. We propose new lower bounding strategies and heuristics for this fundamental scheduling problem. The lower bounds are based on the so-called lifting procedure. In addition, two optimization-based heuristics are proposed. These heuristics require iteratively solving a subset-sum problem. We present the results of computational experiments that provide strong evidence that the new proposed lower and upper bounds consistently outperform the best bounds from the literature. © 2006 Wiley Periodicals, Inc.
Authors & Co-Authors
Haouari, Mohamed
Tunisia, La Marsa
University of Carthage, Ecole Polytechnique de Tunisie
Gharbi, Anis
Tunisia, La Marsa
University of Carthage, Ecole Polytechnique de Tunisie
Tunisia, Ariana
Institut Supérieur D'informatique
Jemmali, Mahdi
Tunisia, La Marsa
University of Carthage, Ecole Polytechnique de Tunisie
Statistics
Citations: 44
Authors: 3
Affiliations: 2
Identifiers
Doi:
10.1111/j.1475-3995.2006.00562.x
ISSN:
09696016
e-ISSN:
14753995