✦ LIBER ✦

Scheduling open shops with parallel machines

✍ Scribed by E.L. Lawler; M.G. Luby; V.V. Vazirani

Book ID: 107917046
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 326 KB
Volume: 1
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(82)90021-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling open shops with parallel mach

Scheduling open shops with parallel machines to minimize total completion time

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

Open shop scheduling with maximal machin

Open shop scheduling with maximal machines

✍ George J. Kyparisis; Christos Koulamas 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 698 KB

## The objective of this paper is to develop polynomial algorithms for the open shop makespan problem. It is shown that when a machine majorizes all other machines and the ith largest processing time on that machine is at least as large as the processing times of all operations on machines i throu

Open-shop scheduling problems with domin

Open-shop scheduling problems with dominated machines

✍ I. Adiri; N. Aizikowitz (Hefetz) 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

Two-machine open shop scheduling with se

Two-machine open shop scheduling with secondary criteria

✍ Jatinder N. D. Gupta; Frank Werner; Gunnar Wulkenhaar 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB

Worst-case analysis of heuristics for op

Worst-case analysis of heuristics for open shops with parallel machines

✍ Bo Chen; Vitaly A. Strusevich 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 623 KB

Scheduling ordered open shops

✍ C.Y. Liu; R.L. Bulfin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 654 KB