A Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints
Publish Year: 1387
Type: Journal paper
Language: English
View: 505
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_JOIE-2-3_008
Index date: 13 November 2018
A Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints abstract
This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. Thepaper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixedor/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regarding thisflexibility in PM activities, we expect to obtain more efficient schedule. A simple technique is employed to schedule production jobs alongwith the flexible MACs caused by PM. To solve the problem, we present a high performing metaheuristic based on memetic algorithmincorporating some advanced features. To evaluate the proposed algorithm, the paper compares the proposed algorithm with several wellknownalgorithms taken from the literature. Finally, we conclude that the proposed algorithm outperforms other algorithms.
A Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints Keywords:
Scheduling , Hybrid flowshops , sequence dependent setup times , machine availibility constraints , memetic algorithm
A Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints authors
Fariborz Jolai
Department of industrial engineering, faculty of engineering, University of Tehran, Tehran, Iran
Mostafa Zandieh
Department of industrial management, management and accounting faculty, Shahid Beheshti University, Tehran, Iran
Bahman Naderi
Department of indusrial engineering, Amirkabir University of Technology, Tehran, Iran