✦ LIBER ✦

A new heuristic for open shop total completion time problem

✍ Scribed by Lixin Tang; Danyu Bai

Book ID: 108057036
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 377 KB
Volume: 34
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2009.06.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new heuristic for minimizing total com

A new heuristic for minimizing total completion time objective in permutation flow shop scheduling

✍ Dipak Laha; Arindam Chakravorty 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 155 KB

An improved branch-and-bound algorithm f

An improved branch-and-bound algorithm for the preemptive open shop total completion time scheduling problem

✍ Liaw, Ching-Fang 📂 Article 📅 2013 🏛 Informa UK (Taylor & Francis) 🌐 English ⚖ 323 KB

A matheuristic approach for the two-mach

A matheuristic approach for the two-machine total completion time flow shop problem

✍ Della Croce, Federico; Grosso, Andrea; Salassa, Fabio 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 414 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

An iterative heuristic for the single ma

An iterative heuristic for the single machine dynamic total completion time scheduling problem

✍ Suresh Chand; Rodney Traub; Reha Uzsoy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1004 KB

A contribution and new heuristics for op

A contribution and new heuristics for open shop scheduling

✍ B. Naderi; S.M.T. Fatemi Ghomi; M. Aminnayeri; M. Zandieh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 914 KB