𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem

✍ Scribed by E. Mokotoff; J.L. Jimeno

Book ID
110409273
Publisher
Springer US
Year
2002
Tongue
English
Weight
116 KB
Volume
117
Category
Article
ISSN
0254-5330

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