✦ LIBER ✦

A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems

✍ Scribed by O. Gholami; Y. N. Sotskov

Book ID: 121816970
Publisher: Springer
Year: 2013
Tongue: English
Weight: 676 KB
Volume: 70
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-013-5281-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic algorithm for solving flexib

A heuristic algorithm for solving flexible job shop scheduling problem

✍ Ziaee, Mohsen 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 929 KB

Solving parallel machines job-shop sched

Solving parallel machines job-shop scheduling problems by an adaptive algorithm

✍ Gholami, Omid; Sotskov, Yuri N. 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 533 KB

Memetic algorithms for solving job-shop

Memetic algorithms for solving job-shop scheduling problems

✍ S. M. Kamrul Hasan; Ruhul Sarker; Daryl Essam; David Cornforth 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 521 KB

Two meta-heuristic algorithms for solvin

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

✍ Vahid Majazi Dalfard; Ghorbanali Mohammadi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Heuristic algorithms for a complex paral

Heuristic algorithms for a complex parallel machine scheduling problem

✍ Zoltán Blázsik; Csanád Imreh; Zoltán Kovács 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 145 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