✦ LIBER ✦

Scheduling the two-machine open shop problem under resource constraints for setting the jobs

✍ Scribed by Oulamara, Ammar; Rebaine, Djamal; Serairi, Mehdi

Book ID: 121593597
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 872 KB
Volume: 211
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-013-1446-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A Dynamic Programming Algorithm for Sche

A Dynamic Programming Algorithm for Scheduling Jobs in a Two-Machine Open Shop with an Availability Constraint

✍ T. Lorigeon, J-C Billaut and J-L Bouquard 📂 Article 📅 2002 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 276 KB

GA based heuristic for the open job shop

GA based heuristic for the open job shop scheduling problem

✍ P. Senthilkumar; P. Shahabudeen 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 102 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

Lower bounds for the job-shop scheduling

Lower bounds for the job-shop scheduling problem on multi-purpose machines

✍ Bernd Jurisch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 765 KB

Extending the Single Machine-Based Relax

Extending the Single Machine-Based Relaxation Scheme for the Job Shop Scheduling Problem

✍ Anis Gharbi; Mohamed Labidi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 515 KB