✦ LIBER ✦

Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems

✍ Scribed by Christos A. Kaskavelis; Michael C. Caramanis

Book ID: 110250982
Publisher: Taylor and Francis Group
Year: 1998
Tongue: English
Weight: 202 KB
Volume: 30
Category: Article
ISSN: 0740-817X
DOI: 10.1023/a:1007515931780

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lagrangian relaxation neural networks fo

Lagrangian relaxation neural networks for job shop scheduling

✍ P. Luh; Xing Zhao; Yajun Wang; L. Thakur 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 254 KB

Memetic algorithms for solving job-shop

Memetic algorithms for solving job-shop scheduling problems

✍ S. M. Kamrul Hasan; Ruhul Sarker; Daryl Essam; David Cornforth 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 521 KB

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

A two-stage genetic algorithm for large

A two-stage genetic algorithm for large size job shop scheduling problems

✍ Yong Ming Wang; Nan Feng Xiao; Hong Li Yin; En Liang Hu; Cheng Gui Zhao; Yan Ron 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 251 KB

Improved genetic algorithm for the job-s

Improved genetic algorithm for the job-shop scheduling problem

✍ Tung-Kuan Liu; Jinn-Tsong Tsai; Jyh-Horng Chou 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 405 KB

A Hybrid Algorithm for Flexible Job-Shop

A Hybrid Algorithm for Flexible Job-Shop Scheduling Problem

✍ Jianchao Tang; Guoji Zhang; Binbin Lin; Bixi Zhang 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 256 KB