Abstract
In this study unrelated parallel machine scheduling problem (UPMSP) with preventive maintenance (PM) and sequence dependent setup times (SDST) is investigated. A novel imperialist competitive algorithm (NICA) with multi-elite individuals guidance is proposed to minimize makespan and total tardiness simultaneously. Initialization is done by two heuristics, each of which is built based on one objective. Multi-elite individuals guidance strategy is added in assimilation that colonies can move toward other imperialists, diversified strategies such as local search and estimation of distribution algorithm (EDA) are adopted based on solution quality in revolution and EDA is also used in imperialist competition. Empire aggression is added by local search of imperialist for plundering a randomly chosen colony. A number of experiments are conducted on the impact of new strategies and the comparisons among NICA and other algorithms. Computational results demonstrate the effectiveness and advantages of NICA in solving UPSMP with PM and SDST.
Highlights
Parallel machine scheduling problem (PMSP) is a typical problem in the manufacturing process [1]–[5], which needs to optimize the target by rational allocation and scheduling of resources
ENCODING AND DECODING unrelated parallel machine scheduling problem (UPMSP) with preventive maintenance (PM) and sequence dependent setup times (SDST) consists of two sub-problems: machine assignment and scheduling.Two-string representation is often used in the previous works [39]–[42]; two strings of a solution are often dependent with each other
Revolution of colony is implemented by local search like mutation of genetic algorithm (GA) and all colonies are changed in a single way
Summary
Parallel machine scheduling problem (PMSP) is a typical problem in the manufacturing process [1]–[5], which needs to optimize the target by rational allocation and scheduling of resources. For UPMSP with SDST, machine eligibility restrictions and a common server, Bektur and Sarac [25] proposed a mixed integer linear programming model and designed a tabu search and a simulated annealing algorithm. UPMSP with PM and SDST is considered and a novel imperialist competitive algorithm (NICA) with multielite individuals guidance is proposed to minimize total tardiness and makespan. A new NICA by introducing EDA into ICA is proposed, which is described in the following sub-sections. A. ENCODING AND DECODING UPMSP with PM and SDST consists of two sub-problems: machine assignment and scheduling.Two-string representation is often used in the previous works [39]–[42]; two strings of a solution are often dependent with each other.
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
