✦ LIBER ✦

Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints

✍ Scribed by Vahid Majazi Dalfard; Ghorbanali Mohammadi

Book ID: 116332556
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 298 KB
Volume: 64
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2012.04.007

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

An improved heuristic for two-machine fl

An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs

✍ Hatem Hadda; Najoua Dridi; Sonia Hajri-Gabouj 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 258 KB