By Topic

Machine scheduling with sequence-dependent setup times using a randomized search heuristic

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

4 Author(s)
Montoya-Torres, J.R. ; Escuela Internacional de Cienc. Economicas y Administrativas, Univ. de La Sabana, Chia, Colombia ; Soto-Ferrari, M. ; Gonzalez-Solano, F. ; Alfonso-Lizarazo, E.H.

This paper considers the problem of scheduling a set of jobs on both a single machine and identical parallel machines with the objective of minimizing the makespan or maximum completion time of all jobs. Jobs are subject to release dates and there are sequence-dependent setup times. Since this problem is known to be strongly NP-hard even for the single machine case, this paper proposes a heuristic algorithm to solve it. The algorithm uses a strategy of random generation of various execution sequences, and then selects the best of such schedules. Experiments are performed using random-generated data. Results show that the heuristic performs very well compared against the optimal solution, and requiring short computational time.

Published in:

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Date of Conference:

6-9 July 2009