Scheduling in an assembly-type production chain with batch transfer

Miao-Tsong Lin*, T. C.E. Cheng, A. S.C. Chou

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

30 Scopus citations

Abstract

This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second stage of a flowshop for processing the component parts in batches. Whenever a batch is formed on the second-stage machine, a constant setup time is required. The objective is to minimize the makespan. In this study we establish the strong NP-hardness of the problem for the case where all the jobs have the same processing time on the second-stage machine. We then explore a useful property, based upon which a special case can be optimally solved in polynomial time. We also study several heuristic algorithms to generate quality approximate solutions for the general problem. Computational experiments are conducted to evaluate the effectiveness of the algorithms.

Original languageEnglish
Pages (from-to)143-151
Number of pages9
JournalOmega
Volume35
Issue number2
DOIs
StatePublished - Apr 2007

Keywords

  • Batch scheduling
  • Heuristics
  • Makespan
  • NP-hardness
  • Two-stage flowshop

Fingerprint Dive into the research topics of 'Scheduling in an assembly-type production chain with batch transfer'. Together they form a unique fingerprint.

Cite this