Abstract:
In this paper, no-wait job shop problems with makespan minimization are considered. It is
well known that these problems are strongly NP-hard. The problem is decomposed into the
sequencing and the timetabling components. The results showed that the new PNS method
gives less makespan value with different problems size (15x15, 20x15, 20x20, 30x15, 30x20,
50x15, 50x20 and 100x20) taken from the OR- library compared to previous well known
neighborhood search methods. In independent setup times we compared the result with the
best solution from OR- library, and have been results indicates the proposed neighborhood
search structure near from best solution compare with other methods of NS.
