NO-WAIT OR NO-IDLE PERMUTATION FLOWSHOP SCHEDULING WITH DOMINATING MACHINES

  • WANG JI BO (Department of Applied Mathematics, Dalian University of Technology) ;
  • XIA ZUN QUAN (Department of Applied Mathematics, Dalian University of Technology)
  • Published : 2005.01.01

Abstract

In this paper we study the no-wait or no-idle permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polynomial-time solution algorithm for each case.

Keywords