𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving the integrated lot-sizing and job-shop scheduling problem

✍ Scribed by Gómez Urrutia, Edwin David; Aggoune, Riad; Dauzère-Pérès, Stéphane

Book ID
121787438
Publisher
Taylor and Francis Group
Year
2014
Tongue
English
Weight
562 KB
Volume
52
Category
Article
ISSN
0020-7543

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient memetic algorithm for solvi
An efficient memetic algorithm for solving the job shop scheduling problem
✍ Liang Gao; Guohui Zhang; Liping Zhang; Xinyu Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 741 KB

## a b s t r a c t The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an eff