✦ LIBER ✦

Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm

✍ Scribed by Rui Zhang; Cheng Wu

Book ID: 113662271
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 892 KB
Volume: 188
Category: Article
ISSN: 0020-0255
DOI: 10.1016/j.ins.2011.11.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bottleneck identification procedures for

Bottleneck identification procedures for the job shop scheduling problem with applications to genetic algorithms

✍ Rui Zhang; Cheng Wu 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 385 KB

A Guide for Genetic Algorithm Based on P

A Guide for Genetic Algorithm Based on Parallel Machine Scheduling and Flexible Job-Shop Scheduling

✍ Ak, Bilgesu; Koc, Erdem 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 357 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