A Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints
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,...
Main Authors: | Fariborz Jolai, mostafa zandieh, Bahman Naderi |
---|---|
Format: | Article |
Language: | English |
Published: |
Islamic Azad University, Qazvin Branch
2010-02-01
|
Series: | Journal of Optimization in Industrial Engineering |
Subjects: | |
Online Access: | http://www.qjie.ir/article_23_a4186a673564b016f5b5a43370600601.pdf |
Similar Items
-
Memetic Algorithm With Meta-Lamarckian Learning and Simplex Search for Distributed Flexible Assembly Permutation Flowshop Scheduling Problem
by: Guanghui Zhang, et al.
Published: (2020-01-01) -
Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown
by: A. Adressi, et al.
Published: (2016-01-01) -
A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem
by: Daniella Castro Araújoa, et al.
Published: (2011-01-01) -
PENJADWALAN PRODUKSI FLEXIBLE FLOWSHOPS DENGAN SEQUENCE-DEPENDENT SETUP TIMES MENGGUNAKAN METODE RELAKSASI LAGRANGIAN (Studi Kasus pada PT. Cahaya Angkasa Abadi)
by: Herry Christian Palit, et al.
Published: (2003-01-01) -
Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
by: Ewa Figielska
Published: (2014-12-01)