Studying the effect of different combinations of timetabling with sequencing algorithms to solve the no-wait job shop scheduling problem.

This paper considers the no-wait job shop (NWJS) problem with makespan minimisation criteria. It is well known that this problem is strongly NP-hard. Most of the previous studies decompose the problem into a timetabling sub-problem and a sequencing sub-problem. Each study proposes a different sequencing and timetabling algorithm to solve the problem. In this research, this important question is aimed to be answered: is the timetabling or the sequencing algorithm more important to the effectiveness of the developed algorithm? In order to find the answer, three different sequencing algorithms are developed; a tabu search (TS), a hybrid of tabu search with variable neighbourhood search (TSVNS), and a hybrid of tabu search with particle swarm optimisation (TSPSO). Afterwards, the sequencing algorithms are combined with four different timetabling methods. All the approaches are applied to a large number of test problems available in the literature. Statistical analysis reveals that although some of the sequencing and timetabling algorithms are more complicated than the others, they are not necessarily superior to simpler algorithms. In fact, some of the simpler algorithms prove to be more effective than complicated and time-consuming methods. [ABSTRACT FROM PUBLISHER]