Title :
Minimizing total flow time in permutation flow shop scheduling with improved simulated annealing
Author :
Chakraborty, Uday K.
Author_Institution :
Dept. of Math & Comput. Sci., Univ. of Missouri, St. Louis, MO
Abstract :
For the past two decades simulated annealing has been playing a crucial role in the design of optimization strategies for flow shop scheduling applications. This paper presents an efficient simulated annealing algorithm for minimizing the total flow time in permutation flow shop scheduling problems. Empirical results demonstrate the improvement in solution quality obtained by the proposed approach over state-of-the-art methods in the literature.
Keywords :
flow shop scheduling; minimisation; simulated annealing; flow time minimisation; optimization strategy; permutation flow shop scheduling; simulated annealing; Computer science; Design optimization; Job design; Job shop scheduling; Processor scheduling; Production control; Production planning; Production systems; Scheduling algorithm; Simulated annealing;
Conference_Titel :
Evolutionary Computation, 2009. CEC '09. IEEE Congress on
Conference_Location :
Trondheim
Print_ISBN :
978-1-4244-2958-5
Electronic_ISBN :
978-1-4244-2959-2
DOI :
10.1109/CEC.2009.4982943