✦ LIBER ✦

Open shop scheduling with some additional constraints

✍ Scribed by D. de Werra; J. Erschler

Book ID: 105329612
Publisher: Springer Japan
Year: 1996
Tongue: English
Weight: 854 KB
Volume: 12
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01858447

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

Shop and batch scheduling with constrain

Shop and batch scheduling with constraints

✍ Malapert, Arnaud 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 74 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

Polynomial-time approximation schemes fo

Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints

✍ M.A. Kubzin; V.A. Strusevich; J. Breit; G. Schmidt 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

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

Open-shop batch scheduling with identica

Open-shop batch scheduling with identical jobs

✍ Gur Mosheiov; Daniel Oron 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 629 KB