By Topic

Heuristics for uniform parallel machine scheduling problem with minimizing makespan

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kai Li ; Sch. of Manage., Hefei Univ. of Technol., Hefei ; Shu-Chu Zhang

This paper considers the problem of uniform parallel machine scheduling with unequal release dates so as to minimize makespan. This problem is proved to an NP-hard problem. Heuristics in existence for the problem are analyzed, and then we present an improved algorithm. The performance of the algorithms by experiment is also analyzed. The heuristic is further extended by applying the method of variable neighborhood search, which is used for improving the quality of the solutions obtained by the original heuristics.

Published in:

Automation and Logistics, 2008. ICAL 2008. IEEE International Conference on

Date of Conference:

1-3 Sept. 2008