𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate

✍ Scribed by Masatoshi Sakawa; Tetsuya Mori

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
210 KB
Volume
36
Category
Article
ISSN
0360-8352

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