𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width

✍ Scribed by Elisabeth Günther, Felix G. König, Nicole Megow

Book ID
120694163
Publisher
Springer US
Year
2012
Tongue
English
Weight
656 KB
Volume
27
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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