Two-stage hybrid flow shop scheduling with dynamic job arrivals

  • Authors:
  • Frank S. Yao;Mei Zhao;Hui Zhang

  • Affiliations:
  • CUHK Business School, Chinese University of Hong Kong, Hong Kong, China;Department of Mathematics, Hong Kong University of Science and Technology, Hong Kong, China;Production Planning Division, Grace Manufacturing Corporation, Shanghai, China

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2012

Quantified Score

Hi-index 0.01

Visualization

Abstract

Motivated by applications in semiconductor manufacturing industry, we consider a two-stage hybrid flow shop where a discrete machine is followed by a batching machine. In this paper, we analyze the computational complexity of a class of two-machine problems with dynamic job arrivals. For the problems belonging to P we present polynomial algorithms. For the NP-complete problems we propose the heuristics, and then establish the upper bounds on the worst case performance ratios of the heuristics. In addition, we give the improved heuristics that can achieve better performances.