Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

Authors:
Chinyao Low
Affiliations:
Department of Industrial Engineering, Da-Yeh University, 112 Shan-Jiau Road, Da-Tsuen, Chang-hua 515, Taiwan, PR China
Venue:
Computers and Operations Research
Year:
2005

Citing 8
Cited 16

Bicriteria scheduling problem for unrelated parallel machines

Computers and Industrial Engineering
An evaluation of sequencing heuristics in flow shops with multiple processors

Computers and Industrial Engineering
Scheduling parallel machines to minimize total weighted and unweighted tardiness

Computers and Operations Research
Early/tardy scheduling with sequence dependent setups on uniform parallel machines

Computers and Operations Research
Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times

Computers and Operations Research
Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks

Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks
Local search heuristics for two-stage flow shop problems with secondary criterion

Computers and Operations Research
Scheduling on uniform parallel machines to minimize maximum lateness

Operations Research Letters

Minimizing the total weighted completion time on unrelated parallel machines with stochastic times

WSC '05 Proceedings of the 37th conference on Winter simulation
Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

Computers and Operations Research
Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated

Robotics and Computer-Integrated Manufacturing
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Computers and Operations Research
Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines

Computers and Industrial Engineering
Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility

Computers and Operations Research
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems

International Journal of Metaheuristics
A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems

Journal of Intelligent Manufacturing
Simulated annealing algorithm with adaptive neighborhood

Applied Soft Computing
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints

Computers and Operations Research
A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times

Expert Systems with Applications: An International Journal
Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints

Computers and Operations Research
A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times

Journal of Intelligent Manufacturing
A simulated annealing heuristic for minimizing makespan in parallel machine scheduling

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Scheduling algorithms for real-time computing systems admitting simulation models

Programming and Computing Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

This article addresses a multi-stage flow shop scheduling problem with unrelated parallel machines. Some practical processing restrictions such as independent setup and dependent removal times are taken into account as well. The objective is to minimize total flow time in the system. A simulated annealing (SA)-based heuristic is proposed to solve the addressed problem in a reasonable running time. The heuristic begins on a well-designed initial solution generator; then a simulated annealing procedure is applied for further improvement of the solution. To assure the quality and efficiency of the solution for the proposed SA-based heuristic, certain mechanisms are developed and introduced into the heuristic. The computational experimental results show that the proposed SA-based heuristic performs well with respect to accuracy and efficiency of solution.