A no-wait flow shop system with sequence dependent setup times and server constraints

摘要

This paper deals with the problem of scheduling the no-wait flow shop system with sequence dependent setup times and server side constraints. No-wait constraints state that there should be no waiting time between consecutive operations of jobs. Moreover, the problem consists of server side constraints, i.e., not all machines have a dedicated server to prepare them for an operation. In other words, several machines share a common server. The considered performance measure is makespan. This problem is proved to be strongly NP-Hard. To deal with the problem two genetic algorithms (GA) are developed. In order to evaluate the performance of the developed frameworks, a large number of benchmark problems are selected and solved with different server limitation scenarios. Computational results confirm the efficiency of the developed algorithms. The effect of the server side constraints on the makespan of the test problems is explained using the computational results.