๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Parallel machine scheduling problems usi
โœ 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