《2016 Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops》.pdf

Computers Industrial Engineering 56 (2009) 113–120 Contents lists available at ScienceDirect Computers Industrial Engineering journal homepage: /locate/caie Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops q Hyun-Seon Choi, Dong-Ho Lee * Department of Industrial Engineering, Hanyang University, Sungdong-gu, Seoul 133-791, Republic of Korea a r t i c l e i n f o a b s t r a c t Article history: This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing Received 5 November 2007 the number of tardy jobs. Each job is processed through the two production stages in series, each of which Received in revised form 10 April 2008 has multiple identical parallel machines. The problem is to determine the allocation of jobs to the parallel Accepted 11 April 2008 machines as well as the sequence of the jobs assigned to each machine. To solve the problem, a branch Available online 23 May 2008 and bound algorithm, which incorporates the methods to obtain the lower and upper bounds as well as the dominance properties to reduce the search space, is suggested that gives the optimal solutions. In Keywords: addition, two-phase heuristic algorithms are suggested to obtain good solutions for large-size problems Scheduling within a reasonable amount of computation time. To show the performances