✦ LIBER ✦

Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs

✍ Scribed by N.V. Shakhlevich; N. Sotskov; F. Werner

Book ID: 110379873
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 363 KB
Volume: 92
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018943016617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of shop-scheduling problems w

Complexity of shop-scheduling problems with fixed number of jobs: a survey

✍ Peter Brucker; Yu N. Sotskov; Frank Werner 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 367 KB

The complexity of shop-scheduling proble

The complexity of shop-scheduling problems with two or three jobs

✍ Yu.N. Sotskov 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 553 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

On the Complexity of Non-preemptive Shop

On the Complexity of Non-preemptive Shop Scheduling with Two Jobs

✍ Tamás Kis 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 149 KB

A study of the flexible job shop schedul

A study of the flexible job shop scheduling problem with parallel machines and reentrant process

✍ J. C. Chen; K. H. Chen; J. J. Wu; C. W. Chen 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 348 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