This paper addresses a two-machine no-wait job shop problem with makespan minimisation. It is well known that this problem is strongly NP-hard. A divide-and-conquer approach (DC for short) is adopted to calculate the optimal timetable of a given sequ