✦ LIBER ✦

Scheduling problems for parallel dedicated machines under multiple resource constraints

✍ Scribed by H. Kellerer; V.A. Strusevich

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 249 KB
Volume: 133
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00433-5

No coin nor oath required. For personal study only.

✦ Synopsis

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classiÿcation is obtained, a number of polynomial-time algorithms are designed. For the problem with a ÿxed number of machines in which a job uses at most one resource of unit size a polynomial-time approximation scheme is o ered.

📜 SIMILAR VOLUMES

An approximate algorithm for a high-mult

An approximate algorithm for a high-multiplicity parallel machine scheduling problem

✍ Carlo Filippi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Genetic algorithms for the job-shop sche

Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence

✍ Fatima Ghedjati 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an