✦ LIBER ✦

Genetic algorithms for flowshop scheduling problems

✍ Scribed by Tadahiko Murata; Hisao Ishibuchi; Hideo Tanaka

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 759 KB
Volume: 30
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(96)00053-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A search algorithm for the generalized f

A search algorithm for the generalized flowshop scheduling problem

✍ Jatinder N.D. Gupta 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 789 KB

An improved lexicographic search algorit

An improved lexicographic search algorithm for the flowshop scheduling problem

✍ Jatinder N.D. Gupta 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Multi-objective genetic algorithm and it

Multi-objective genetic algorithm and its applications to flowshop scheduling

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

Application of genetic algorithm for sch

Application of genetic algorithm for scheduling and schedule coordination problems

✍ Prabhat Shrivastava; S. L. Dhingra; P. J. Gundaliya 📂 Article 📅 2002 🏛 Institute for Transportation Inc. 🌐 English ⚖ 859 KB

Heuristic algorithms for scheduling in t

Heuristic algorithms for scheduling in the no-wait flowshop

✍ Rajesh Gangadharan; Chandrasekharan Rajendran 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 411 KB

A genetic algorithm methodology for comp

A genetic algorithm methodology for complex scheduling problems

✍ Bryan A. Norman; James C. Bean 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB 👁 2 views

This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration ty