✦ LIBER ✦

Robust Metaheuristics for Scheduling Cellular Flowshop with Family Sequence-Dependent Setup Times

✍ Scribed by Ibrahem, Al-mehdi; Elmekkawy, Tarek; Peng, Qingjin

Book ID: 125793436
Publisher: Elsevier
Year: 2014
Tongue: English
Weight: 478 KB
Volume: 17
Category: Article
ISSN: 2212-8271
DOI: 10.1016/j.procir.2014.01.072

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Metaheuristics for scheduling a no-wait

Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups

✍ Kuo-Ching Ying; Zne-Jung Lee; Chung-Cheng Lu; Shih-Wei Lin 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 316 KB

Robust metaheuristics for group scheduli

Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops

✍ M. Zandieh; Behrouz Dorri; A. R. Khamseh 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 256 KB

Hybrid metaheuristics for unrelated para

Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times

✍ Chun-Lung Chen; Chuen-Lung Chen 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 172 KB

A bicriteria m-machine flowshop scheduli

A bicriteria m-machine flowshop scheduling with sequence-dependent setup times

✍ Tamer Eren 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 495 KB

Scheduling a Bi-Objective Hybrid Flow Sh

Scheduling a Bi-Objective Hybrid Flow Shop with Sequence-Dependent Family Setup Times Using Metaheuristics

✍ M. Fadaei, M. Zandieh 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 802 KB

Scheduling flowshops with finite buffers

Scheduling flowshops with finite buffers and sequence-dependent setup times

✍ Bryan A Norman 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 145 KB

In this paper we explore ¯owshop scheduling problems containing both sequence-dependent setup times and ®nite buers. To the best of our knowledge, problems containing both of these complexities have not been addressed previously in the literature. The problem is clearly NP-hard and therefore we only