Abstract
In this paper, an efficient differential evolution approach, namely DE_NTJ, is presented to minimize the number of tardy jobs (NTJ) for the no-wait flow-shop scheduling problem (NFSSP) with sequence-dependent setup times (SDSTs) and release dates (RDs), which is a complex problem and can be abbreviated as NTJ-NFSSP with SDSTs and RDs. To balance the exploration and exploitation abilities of our DE_NTJ, DE-based global search is utilized to obtain the promising regions or solutions over the solution space, and a local search based on the interchange-based neighborhood and problem's properties is developed to exploit the neighborhoods from these regions. Simulation results based on a set of random instances show the superiority of DE_NTJ in terms of searching quality, efficiency, and robustness.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
