Minimizing makespan on an m-machine re-entrant flowshop

Authors:
Seong-Woo Choi;Yeong-Dae Kim
Affiliations:
Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Yusong-gu, Daejon 305-701, Korea;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Yusong-gu, Daejon 305-701, Korea
Venue:
Computers and Operations Research
Year:
2008

Citing 7
Cited 7

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

Computers and Operations Research
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
A simulated annealing heuristic for scheduling in a flowshop with bicriteria

ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research
Design and Analysis of Experiments

Design and Analysis of Experiments
Minimizing makespan on an m-machine re-entrant flowshop

Computers and Operations Research

Minimizing makespan on an m-machine re-entrant flowshop

Computers and Operations Research
Heuristic algorithms for two machine re-entrant flow shop

Theoretical Computer Science
Scheduling a multi-chip package assembly line with reentrant processes and unrelated parallel machines

Proceedings of the 40th Conference on Winter Simulation
Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan

Applied Soft Computing
Minimizing total completion time for re-entrant flow shop scheduling problems

Theoretical Computer Science
A self-adaptive hybrid population-based incremental learning algorithm for M-machine reentrant permutation flow-shop scheduling

ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper focuses on an m-machine re-entrant flowshop scheduling problem with the objective of minimizing makespan. In the re-entrant flowshop considered here, routes of all jobs are identical as in ordinary flowshops, but the jobs must be processed multiple times on the machines. We present heuristic algorithms, which are modified from well-known existing algorithms for the general m-machine flowshop problem or newly developed in this research. For evaluation of the performance of the algorithms, computational experiments are performed on randomly generated test problems and results are reported.