Two-machine, no-wait job shop problem with separable setup times and single-server constraints.

No-wait job shop scheduling problems refer to the set of problems in which a number of jobs are available for processing on a number of machines in a job shop context with the added constraint that there should be no waiting time between consecutive operations of the jobs. In this paper, a two-machine, no-wait job shop problem with separable setup times and a single-server constraint is considered. The considered performance measure is the makespan. This problem is strongly NP-hard. A mathematical model of the problem is developed and a number of propositions are proven for the special cases. Moreover, a genetic algorithm is proposed in this paper to find the optimal (or near-optimal) solutions. In order to evaluate the developed algorithm, a number of small instances are solved to optimality using the developed mathematical model. The proposed algorithm is able to find the optimal solution of all of these cases. For larger instances, the developed algorithm has been compared with the 2-opt algorithm as well as a proposed lower bound. Computational results show the efficiency of the proposed algorithm in generating good quality solutions compared to the developed lower bounds and 2-opt algorithm. [ABSTRACT FROM AUTHOR]