Minimizing total flow time in permutation flow shop scheduling with improved simulated annealing

Authors:
Uday K. Chakraborty
Affiliations:
Department of Math & Computer Science, University of Missouri, St. Louis
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 10
Cited 0

The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem

Computers and Operations Research
An effective hybrid optimization strategy for job-shop scheduling problems

Computers and Operations Research
Advanced Engineering Mathematics: Maple Computer Guide

Advanced Engineering Mathematics: Maple Computer Guide
New heuristics for no-wait flowshops to minimize makespan

Computers and Operations Research
A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

Computers and Operations Research
Comparison of heuristics for flowtime minimisation in permutation flowshops

Computers and Operations Research
Two-machine flow shop problems with a single server

Journal of Scheduling
An efficient stochastic hybrid heuristic for flowshop scheduling

Engineering Applications of Artificial Intelligence
An improved heuristic for permutation flowshop scheduling

International Journal of Information and Communication Technology
Approximative procedures for no-wait job shop scheduling

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.