Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type

Authors:
Bertrand M. T. Lin;F. J. Hwang
Affiliations:
Institute of Information Management, Department of Information and Finance Management, National Chiao Tung University, Hsinchu, Taiwan;Institute of Information Management, Department of Information and Finance Management, National Chiao Tung University, Hsinchu, Taiwan
Venue:
Information Processing Letters
Year:
2011

Citing 2
Cited 2

Batching and scheduling in a multi-machine flow shop

Journal of Scheduling
Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times

Computers and Operations Research

Coupled-task scheduling on a single machine subject to a fixed-job-sequence

Computers and Industrial Engineering
A heuristic method for two-stage hybrid flow shop with dedicated machines

Computers and Operations Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper addresses the total completion time minimization in a two-stage differentiation flowshop where the sequences of jobs per type are predetermined. The two-stage differentiation flowshop consists of a stage-1 common machine and m stage-2 parallel dedicated machines. The goal is to determine an optimal interleaved processing sequence of all jobs at the first stage. We propose an O(m^2@?"k"="1^mn"k^m^+^1) dynamic programming algorithm, where n"k is the number of type-k jobs. The running time is polynomial when m is constant.