✦ LIBER ✦

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

✍ Scribed by Tamás Kis; Dominique de Werra; Wieslaw Kubiak

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 865 KB
Volume: 38
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2009.10.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-preemptive two-machine open shop sch

Non-preemptive two-machine open shop scheduling with non-availability constraints

✍ J. Breit; G. Schmidt; V. A. Strusevich 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 309 KB

A Genetic Algorithm for Hybrid Flow-shop

A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

✍ Ceyda Oĝuz; M. Fikret Ercan 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 642 KB

A polynomial algorithm for the two machi

A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs

✍ Peter Brucker 📂 Article 📅 1994 🏛 Springer 🌐 German ⚖ 289 KB

Heuristic algorithms for preemptive sche

Heuristic algorithms for preemptive scheduling in a two-stage hybrid flowshop with additional renewable resources at each stage

✍ Ewa Figielska 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 464 KB

This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and renewable resources at both the stages. The resource requirements are of a 0-1 type. The objective is the minimization of makespan. The problem is NP-hard. Four heuristic algorithm