✦ LIBER ✦

Scheduling Parallel Machines for the Customer Order Problem

✍ Scribed by Jaehwan Yang; Marc E. Posner

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 219 KB
Volume: 8
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-005-5315-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Customer order scheduling problem: a com

Customer order scheduling problem: a comparative metaheuristics study

✍ Öncü Hazır; Yavuz Günalay; Erdal Erel 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 201 KB

Semi-Online Algorithms for Parallel Mach

Semi-Online Algorithms for Parallel Machine Scheduling Problems

✍ G. Dósa; Y. He 📂 Article 📅 2004 🏛 Springer Vienna 🌐 English ⚖ 288 KB

Heuristics for scheduling unrelated para

Heuristics for scheduling unrelated parallel machines

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 961 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

A new ILS algorithm for parallel machine

A new ILS algorithm for parallel machine scheduling problems

✍ Lixin Tang; Jiaxiang Luo 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 191 KB

Parallel machine scheduling problems usi

Parallel machine scheduling problems using memetic algorithms

✍ Runwei Cheng; Mitsuo Gen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 309 KB

In this paper, we investigate how to apply the hybrid genetic algorithms (the memeti¢ algorithms) to solve the parallel machine scheduling problem. There are two essential issues to be dealt with for all kinds of parallel machine scheduling problems: job partition among machines and job sequence wit