๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improved solutions for job shop scheduling problems through genetic algorithm with a different method of schedule deduction

โœ Scribed by K.S. Amirthagadeswaran; V.P. Arunachalam

Publisher
Springer
Year
2005
Tongue
English
Weight
512 KB
Volume
28
Category
Article
ISSN
0268-3768

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