✦ LIBER ✦

Discrepancy search for the flexible job shop scheduling problem

✍ Scribed by Abir Ben Hmida; Mohamed Haouari; Marie-José Huguet; Pierre Lopez

Book ID: 108106970
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 535 KB
Volume: 37
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2010.03.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Flexible job shop scheduling with tabu s

Flexible job shop scheduling with tabu search algorithms

✍ Mohammad Saidi-Mehrabad; Parviz Fattahi 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 181 KB

An efficient search method for multi-obj

An efficient search method for multi-objective flexible job shop scheduling problems

✍ Li-Ning Xing; Ying-Wu Chen; Ke-Wei Yang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 479 KB

Problem difficulty for tabu search in jo

Problem difficulty for tabu search in job-shop scheduling

✍ Jean-Paul Watson; J.Christopher Beck; Adele E. Howe; L.Darrell Whitley 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from sim

Flexible job-shop scheduling problem by

Flexible job-shop scheduling problem by genetic algorithm

✍ Kenichi Ida; Kensaku Oka 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

A hybrid scatter search for the partial

A hybrid scatter search for the partial job shop scheduling problem

✍ Mohammad Mahdi Nasiri; Farhad Kianfar 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 595 KB

A new local search algorithm for the job

A new local search algorithm for the job shop scheduling problem

✍ Huang Wen-qi; Yin Ai-hua 📂 Article 📅 2003 🏛 Wuhan University 🌐 English ⚖ 535 KB