✦ LIBER ✦

A genetic algorithm for flowshop sequencing

✍ Scribed by Colin R. Reeves

Book ID: 107950923
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 658 KB
Volume: 22
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(93)e0014-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Application of Genetic Algorithms to Che

Application of Genetic Algorithms to Chemical Flowshop Sequencing

✍ J. Poživil; M. Žd'ánský 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB 👁 2 views

Genetic algorithms for flowshop scheduli

Genetic algorithms for flowshop scheduling problems

✍ Tadahiko Murata; Hisao Ishibuchi; Hideo Tanaka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 759 KB

A genetic algorithm for the flowshop sch

A genetic algorithm for the flowshop scheduling problem

✍ Qi Yuesheng; Wang Baozhong; Kang Lishan 📂 Article 📅 1998 🏛 Wuhan University 🌐 English ⚖ 217 KB

A Heuristic Genetic Algorithm for No-Wai

A Heuristic Genetic Algorithm for No-Wait Flowshop Scheduling Problem

✍ Jun-lin CHANG; Dun-wei GONG; Xiao-ping MA 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 84 KB

An improved genetic algorithm for robust

An improved genetic algorithm for robust permutation flowshop scheduling

✍ Qiong Liu; Saif Ullah; Chaoyong Zhang 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 242 KB

Evolutionary algorithms for flowshop seq

Evolutionary algorithms for flowshop sequencing with non-unique jobs

✍ R.L. Burdett; E. Kozan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

Sequencing problems are dicult combinatorial problems because of the extremely large search space of possible solutions and the large number of ``local'' optima that arise. Unlike other NP-hard combinatorial problems, the search space, in general, for sequencing problems (under the makespan objectiv