𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints

✍ Scribed by K. Neumann; W.G. Schneider

Book ID
110380062
Publisher
Springer US
Year
1999
Tongue
English
Weight
231 KB
Volume
92
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