✦ LIBER ✦

Scheduling two jobs with fixed and nonfixed routes

✍ Scribed by N. V. Shakhlevich; Yu. N. Sotskov

Book ID: 105509655
Publisher: Springer Vienna
Year: 1994
Tongue: English
Weight: 677 KB
Volume: 52
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02243393

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximability of scheduling with fixed

Approximability of scheduling with fixed jobs

✍ Mark Scharbrodt; Angelika Steger; Horst Weisser 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 142 KB

Scheduling problems of minimizing the makespan on identical parallel machines are among the most wellstudied problems -especially in the ÿeld of approximation. In modern industrial software however, it has become standard to work on a variant of this problem, where some of the jobs are already ÿxed

Scheduling jobs with fixed start and end

Scheduling jobs with fixed start and end times

✍ Esther M. Arkin; Ellen B. Silverberg 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 519 KB

On-line scheduling of jobs with fixed st

On-line scheduling of jobs with fixed start and end times

✍ Gerhard J. Woeginger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 853 KB

Scheduling two groups of jobs with incom

Scheduling two groups of jobs with incomplete information

✍ Guochuan Zhang; Xiaoqiang Cai; C. K. Wong 📂 Article 📅 2003 🏛 SP Systems Engineering Society of China 🌐 English ⚖ 224 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

Two Job Cyclic Scheduling With Incompati

Two Job Cyclic Scheduling With Incompatibility Constraints

✍ Piero Persi; Walter Ukovich; Raffaele Pesenti 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 978 KB