Experimental analysis in simulated annealing to scheduling problems when upper bounds are used

Authors:
Marco Antonio Cruz-Chávez;Juan Frausto-Solís;David Juárez-Romero
Affiliations:
Center of Investigation in Engineering and Applied Science, UAEM, Cuernavaca, Morelos, México;Department of Computer Science, ITESM, Temixco, Morelos, México;Center of Investigation in Engineering and Applied Science, UAEM, Cuernavaca, Morelos, México
Venue:
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
Year:
2005

Citing 4
Cited 0

The shifting bottleneck procedure for job shop scheduling

Management Science
An algorithm for solving the job-shop problem

Management Science
Job shop scheduling by simulated annealing

Operations Research
Genetic Algorithms in Engineering Systems

Genetic Algorithms in Engineering Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm of simulated annealing for the job shop scheduling problem is presented. The proposed algorithm restarts with a new value every time the previous algorithm finishes. To begin the process of annealing, the starting point is a randomly generated schedule with the condition that the initial value of the makespan of the schedule does not surpass a previously established upper bound. The experimental results show the importance of using upper bounds in simulated annealing in order to more quickly approach good solutions.