𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An application of genetic algorithms for flow shop problems

✍ Scribed by Chuen-Lung Chen; Venkateswara S. Vempati; Nasser Aljaber

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
555 KB
Volume
80
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An agent-based parallel approach for the
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
✍ Leila Asadzadeh; Kamran Zamanifar πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 599 KB

The job shop scheduling problem is one of the most important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate s