✦ LIBER ✦

A contribution and new heuristics for open shop scheduling

✍ Scribed by B. Naderi; S.M.T. Fatemi Ghomi; M. Aminnayeri; M. Zandieh

Book ID: 108105934
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 914 KB
Volume: 37
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2009.04.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics for flow-shop scheduling

✍ KING, J. R.; SPACHIS, A. S. 📂 Article 📅 1980 🏛 Taylor and Francis Group 🌐 English ⚖ 280 KB

GA based heuristic for the open job shop

GA based heuristic for the open job shop scheduling problem

✍ P. Senthilkumar; P. Shahabudeen 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 102 KB

Non-greedy heuristics and augmented neur

Non-greedy heuristics and augmented neural networks for the open-shop scheduling problem

✍ Selcuk Colak; Anurag Agarwal 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

Classical and new heuristics for the ope

Classical and new heuristics for the open-shop problem: A computational evaluation

✍ Christelle Guéret; Christian Prins 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 111 KB

We study the problem of constructing minimum makespan schedules for the Open-Shop problem. This paper presents two new heuristics: the ®rst one is a list scheduling algorithm with two priorities. The second is based on the construction of matchings in a bipartite graph. We develop several versions o

Heuristics for short route job shop sche

Heuristics for short route job shop scheduling problems

✍ Inna G. Drobouchevitch; Vitaly A. Strusevich 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 263 KB

A new heuristic for open shop total comp

A new heuristic for open shop total completion time problem

✍ Lixin Tang; Danyu Bai 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 377 KB