Abstract
Unrelated parallel machine scheduling problems (UPMSP) with various processing constraints have been considered fully; however, a UPMSP with deteriorating preventive maintenance (PM) and sequence-dependent setup time (SDST) is seldom considered. In this study, a new differentiated shuffled frog-leaping algorithm (DSFLA) is presented to solve the problem with makespan minimization. The whole search procedure consists of two phases. In the second phase, quality evaluation is done on each memeplex, then the differentiated search processes are implemented between good memeplexes and other ones, and a new population shuffling is proposed. We conducted a number of experiments. The computational results show that the main strategies of DSFLA were effective and reasonable and DSFLA was very competitive at solving UPMSP with deteriorating PM and SDST.
Highlights
The parallel machine scheduling problem (PMSP) is a typical scheduling problem that can be categorized into three types: identical PMSP, uniform PMSP, and unrelatedPMSP (UPMSP)
It can be applied to our Unrelated parallel machine scheduling problems (UPMSP) after the decoding procedure of differentiated shuffled frog-leaping algorithm (DSFLA) is adopted, and we selected it as a comparative algorithm
DSFLA was compared with shuffled frog-leaping algorithm (SFLA), artificial bee colony (ABC)-tabu search (TS), hybrid particle swarm optimization and genetic algorithm (HPSOGA), and multi-start algorithm (MSA)
Summary
The parallel machine scheduling problem (PMSP) is a typical scheduling problem that can be categorized into three types: identical PMSP, uniform PMSP, and unrelated. Caniyilmaz et al [18] applied an ABC algorithm to solve UPMSP with processing set restrictions, an SDST, and a due date. The existing works on scheduling problems revealed that SFLA has great potential in solving UPMSP with deteriorating PM and SDST. The same search process and parameters are adopted in all memeplexes, and the differentiated search process is seldom used, which can effectively intensify the exploration ability and avoid falling local optima; it is necessary to investigate the possible applications of SFLA with new optimization mechanisms for UPMSP with SDST and PM. UPMSP with deteriorating PM and SDST is considered, and a new differentiated shuffled frog-leaping algorithm (DSFLA) is applied to minimize the makespan.
Sign-in/Register to view highlights & summary 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
