✦ LIBER ✦

Simulated annealing for the permutation flowshop problem

✍ Scribed by FA Ogbu; DK Smith

Book ID: 113322663
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 251 KB
Volume: 19
Category: Article
ISSN: 0305-0483
DOI: 10.1016/0305-0483(91)90036-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel Simulated Annealing with Geneti

Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

✍ Michał Czapiński 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 616 KB

In this paper, parallelisable Simulated Annealing with Genetic Enhancement (SAwGE) algorithm is presented and applied to Permutation Flowshop Scheduling Problem with total flowtime criterion. This problem is proved to be NP-complete in a strong sense for more than one machine. SAwGE is based on a Cl

New MILP models for the permutation flow

New MILP models for the permutation flowshop problem

✍ Tseng, F T; Stafford, E F 📂 Article 📅 2008 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 178 KB

Applying a hybrid simulated annealing an

Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems

✍ Lin, S.-W.; Ying, K.-C. 📂 Article 📅 2008 🏛 Taylor and Francis Group 🌐 English ⚖ 206 KB

Simulated annealing for permutation flow

Simulated annealing for permutation flow-shop scheduling

✍ IH Osman; CN Potts 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 542 KB

A new integer programming formulation fo

A new integer programming formulation for the permutation flowshop problem

✍ A.M. Frieze; J. Yadegar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 447 KB

A GRASP heuristic for the multi-objectiv

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

✍ José Elias Claudio Arroyo; Ana Amélia de Souza Pereira 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 760 KB