✦ LIBER ✦

Constructive heuristic algorithms for the open shop problem

✍ Scribed by H. Bräsel; T. Tautenhahn; F. Werner

Publisher: Springer Vienna
Year: 1993
Tongue: English
Weight: 698 KB
Volume: 51
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02243845

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic algorithms for continuous flow

Heuristic algorithms for continuous flow-shop problem

✍ Chandrasekharan Rajendran; Dipak Chaudhuri 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 497 KB 👁 1 views

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

Competitive genetic algorithms for the o

Competitive genetic algorithms for the open-shop scheduling problem

✍ Christian Prins 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 170 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

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

A new constructive heuristic for the flo

A new constructive heuristic for the flowshop scheduling problem

✍ Christos Koulamas 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 402 KB