✦ LIBER ✦

Open-shop scheduling problems with dominated machines

✍ Scribed by I. Adiri; N. Aizikowitz (Hefetz)

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 409 KB
Volume: 36
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3220360305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the open shop scheduling problem

✍ Ulrich Dorndorf; Erwin Pesch; Toàn Phan-Huy 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 128 KB

Only few exact solution methods are available for the open shop scheduling problem. We describe a branch-and-bound algorithm for solving this problem which performs better than other existing algorithms. The key to the e ciency of our algorithm lies in the following approach: instead of analysing an

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

Scheduling batches with simultaneous job

Scheduling batches with simultaneous job processing for two-machine shop problems

✍ C. N. Potts; V. A. Strusevich; T. Tautenhahn 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 210 KB 👁 2 views

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

Scheduling and lot streaming in two-mach

Scheduling and lot streaming in two-machine open shops with no-wait in process

✍ Nicholas G. Hall; Gilbert Laporte; Esaignani Selvarajah; Chelliah Sriskandarajah 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

Minimizing the makespan in open-shop sch

Minimizing the makespan in open-shop scheduling problems with a convex resource consumption function

✍ Dvir Shabtay; Moshe Kaspi 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB