Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence

F. J. Hwang, Miao-Tsong Lin*

*Corresponding author for this work

Research output: Contribution to journalArticle

12 Scopus citations

Abstract

This paper discusses a two-stage assembly-type flowshop scheduling problem with batching considerations subject to a fixed job sequence. The two-stage assembly flowshop consists of m stage-1 parallel dedicated machines and a stage-2 assembly machine which processes the jobs in batches. Four regular performance metrics, namely, the total completion time, maximum lateness, total tardiness, and number of tardy jobs, are considered. The goal is to obtain an optimal batching decision for the predetermined job sequence at stage 2. This study presents a two-phase algorithm, which is developed by coupling a problem-transformation procedure with a dynamic program. The running time of the proposed algorithm is O(mnn 5), where n is the number of jobs.

Original languageEnglish
Pages (from-to)839-845
Number of pages7
JournalJournal of the Operational Research Society
Volume63
Issue number6
DOIs
StatePublished - 1 Jun 2012

Keywords

  • assembly flowshop; batch scheduling; fixed sequence; dynamic programming

Fingerprint Dive into the research topics of 'Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence'. Together they form a unique fingerprint.

  • Cite this