Heuristic algorithms for two machine re-entrant flow shop

Authors:
Caixia Jing;Guochun Tang;Xingsan Qian
Affiliations:
College of Management, University of Shanghai for Science and Technology, Shanghai, China;Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai, China;College of Management, University of Shanghai for Science and Technology, Shanghai, China
Venue:
Theoretical Computer Science
Year:
2008

Citing 4
Cited 1

Batching and scheduling in FMS hubs: flow time considerations

Operations Research
A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem

Expert Systems with Applications: An International Journal
Minimizing makespan on an m-machine re-entrant flowshop

Computers and Operations Research
Hybrid tabu search for re-entrant permutation flow-shop scheduling problem

Expert Systems with Applications: An International Journal

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

Theoretical Computer Science

Quantified Score

Hi-index	5.24

Visualization

Abstract

This paper focuses on a two machine re-entrant flow shop scheduling problem with the objective of minimizing makespan. In the re-entrant flow shop considered here, each job has the processing route (M"1, M"2, M"1, M"2, ..., M"1, M"2). We present heuristic algorithms, some are modified from existing algorithms and some are newly developed. Extensive computational experiments are performed to evaluate the performance of the heuristics. Results of the experiments show that the performance of heuristics is significantly affected by the distribution of workloads on machines and some of them are excellent.