𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A genetic algorithm for job shop scheduling — a case study

✍ Scribed by N.S.Hemant Kumar; G. Srinivasan

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
601 KB
Volume
31
Category
Article
ISSN
0166-3615

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tutorial survey of job-shop scheduling
A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid genetic search strategies
✍ Runwei Cheng; Mitsuo Gen; Yasuhiro Tsujimura 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. During the past decade, two important issues have been extensively studied. One is how to encode a solution into a chromosome so as to ensure that a chromosome will correspond to a feasible solution. Th

A tutorial survey of job-shop scheduling
A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies
✍ Runwei Cheng; Mitsuo Gen; Yasuhiro Tsujimura 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. During the last three decades, this problem has captured the interest of a signi®cant number of researchers. A lot of literature has been published, but no ecient solution algorithm has been found yet f

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