✦ LIBER ✦

A note on the complexity of the concurrent open shop problem

✍ Scribed by Thomas A. Roemer

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 331 KB
Volume: 9
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-006-7042-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the proof of the complexity of

A note on the proof of the complexity of the little-preemptive open-shop problem

✍ Evgeny V. Shchepin; Nodari Vakhania 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 208 KB

Minimizing the sum of weighted completio

Minimizing the sum of weighted completion times in a concurrent open shop

✍ Monaldo Mastrolilli; Maurice Queyranne; Andreas S. Schulz; Ola Svensson; Nelson 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 315 KB

A note on a problem in the theory of gra

A note on a problem in the theory of grammatical complexity

✍ W. Bucher 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 865 KB

A note on the flow-shop problem without

A note on the flow-shop problem without interruptions in job processing

✍ Wlodzimierz Szwarc 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

A note on mathematical aspects of the 3

A note on mathematical aspects of the 3 × n job-shop sequencing problem

✍ Wlodzimierz Szwarc 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB

The open shop scheduling problem with a

The open shop scheduling problem with a given sequence of jobs on one machine

✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a