A note on two-stage hybrid flowshop scheduling with missing operations

Authors:
Chao-Tang Tseng;Ching-Jong Liao;Tai-Xiang Liao
Affiliations:
Department of Industrial Engineering and Management, Chaoyang University of Technology, Taichung County 413, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, 43, Section 4, Keelung Road, Taipei 106, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, 43, Section 4, Keelung Road, Taipei 106, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 5
Cited 3

A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective

Computers and Operations Research
An evaluation of sequencing heuristics in flow shops with multiple processors

Computers and Industrial Engineering
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems

Computers and Industrial Engineering
Permutation vs. non-permutation flow shop schedules

Operations Research Letters

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

Computers and Operations Research
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search

Computers and Industrial Engineering
A two-stage hybrid flowshop scheduling problem in machine breakdown condition

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The scheduling problem in a multi-stage hybrid flowshop has been the subject of considerable research. All the studies on this subject assume that each job has to be processed on all the stages, i.e., there are no missing operations for a job at any stage. However, missing operations usually exist in many real-life production systems, such as a system in a stainless steel factory investigated in this note. The studied production system in the factory is composed of two stages in series. The first stage contains only one machine while the second stage consists of two identical machines (namely a 1x2 hybrid flowshop). In the system, some jobs have to be processed on both stages, but others need only to be processed on the second stage. Accordingly, the addressed scheduling problem is a 1x2 hybrid flowshop with missing operations at the first stage. In this note, we develop a heuristic for the problem to generate a non-permutation schedule (NPS) from a given permutation schedule, with the objective of minimizing the makespan. Computational results demonstrate that the heuristic can efficiently generate better NPS solutions.