✦ LIBER ✦

A GRASP heuristic for the multi-objective permutation flowshop scheduling problem

✍ Scribed by José Elias Claudio Arroyo; Ana Amélia de Souza Pereira

Publisher: Springer
Year: 2010
Tongue: English
Weight: 760 KB
Volume: 55
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-010-3100-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multi-heuristic desirability ant colony

Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems

✍ Kuo-Ching Ying; Shih-Wei Lin 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 291 KB

A new constructive heuristic for the flo

A new constructive heuristic for the flowshop scheduling problem

✍ Christos Koulamas 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 402 KB

A particle swarm optimization for multi-

A particle swarm optimization for multi-objective flowshop scheduling

✍ D. Y. Sha; Hsing Hung Lin 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 186 KB

A stochastic permutation-flowshop schedu

A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length

✍ I Adiri; E Frostig 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 148 KB

A branch-and-bound algorithm with fuzzy

A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

✍ Jinliang Cheng; Hiroshi Kise; Hironori Matsumoto 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 697 KB

This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modem manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for thi

A new heuristic for minimizing total com

A new heuristic for minimizing total completion time objective in permutation flow shop scheduling

✍ Dipak Laha; Arindam Chakravorty 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 155 KB