✦ LIBER ✦

A machine-order search space for job-shop scheduling problems

✍ Scribed by S. H. Choi; F. Y. Yang

Book ID: 108572843
Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 155 KB
Volume: 10
Category: Article
ISSN: 0969-6016
DOI: 10.1111/1475-3995.00430

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A search space analysis of the Job Shop

A search space analysis of the Job Shop Scheduling Problem

✍ D.C. Mattfeld; C. Bierwirth; H. Kopfer 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 194 KB

Active solution space and search on job-

Active solution space and search on job-shop scheduling problem

✍ Masato Watanabe; Kenichi Ida; Mitsuo Gen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 329 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

Discrepancy search for the flexible job

Discrepancy search for the flexible job shop scheduling problem

✍ Abir Ben Hmida; Mohamed Haouari; Marie-José Huguet; Pierre Lopez 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 535 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

Scheduling batches with simultaneous job

Scheduling batches with simultaneous job processing for two-machine shop problems

✍ C. N. Potts; V. A. Strusevich; T. Tautenhahn 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 210 KB 👁 2 views