A Memetic Algorithm for Hybrid Flowshops with Flexible MachineAvailability Constraints
محورهای موضوعی : Design of Experiment
Fariborz Jolai
1
(Department of industrial engineering, faculty of engineering, University of Tehran, Tehran, Iran)
mostafa zandieh
2
(Department of industrial management, management and accounting faculty, Shahid Beheshti University, Tehran, Iran)
Bahman Naderi
3
(Department of indusrial engineering, Amirkabir University of Technology, Tehran, Iran)
کلید واژه: Scheduling, Hybrid flowshops, sequence dependent setup times, machine availibility constraints, memetic algorithm,
چکیده مقاله :
This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regarding this flexibility in PM activities, we expect to obtain more efficient schedule. A simple technique is employed to schedule production jobs along with the flexible MACs caused by PM. To solve the problem, we present a high performing metaheuristic based on memetic algorithm incorporating some advanced features. To evaluate the proposed algorithm, the paper compares the proposed algorithm with several wellknown algorithms taken from the literature. Finally, we conclude that the proposed algorithm outperforms other algorithms.
