✦ LIBER ✦

A hybrid scatter search for the partial job shop scheduling problem

✍ Scribed by Mohammad Mahdi Nasiri; Farhad Kianfar

Publisher: Springer
Year: 2010
Tongue: English
Weight: 595 KB
Volume: 52
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-010-2792-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hybrid Rollout Approaches for the Job Sh

Hybrid Rollout Approaches for the Job Shop Scheduling Problem

✍ F. Guerriero 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 417 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

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

Hybridizing tabu search with ant colony

Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems

✍ V. P. Eswaramurthy; A. Tamilarasi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 250 KB

A hybrid particle swarm optimization app

A hybrid particle swarm optimization approach for the job-shop scheduling problem

✍ Wei-jun Xia; Zhi-ming Wu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 444 KB

A Tabu Search Algorithm for Job Shop Sch

A Tabu Search Algorithm for Job Shop Scheduling

✍ S. G. Ponnambalam; P. Aravindan; S. V. Rajesh 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 108 KB