✦ LIBER ✦

Competitive genetic algorithms for the open-shop scheduling problem

✍ Scribed by Christian Prins

Publisher: Springer
Year: 2000
Tongue: English
Weight: 170 KB
Volume: 52
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s001860000090

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Solving the open shop scheduling problem

✍ Ulrich Dorndorf; Erwin Pesch; Toàn Phan-Huy 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 128 KB

Only few exact solution methods are available for the open shop scheduling problem. We describe a branch-and-bound algorithm for solving this problem which performs better than other existing algorithms. The key to the e ciency of our algorithm lies in the following approach: instead of analysing an

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

An effective hybrid genetic algorithm fo

An effective hybrid genetic algorithm for the job shop scheduling problem

✍ Chaoyong Zhang; Yunqing Rao; Peigen Li 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 398 KB

Constructive heuristic algorithms for th

Constructive heuristic algorithms for the open shop problem

✍ H. Bräsel; T. Tautenhahn; F. Werner 📂 Article 📅 1993 🏛 Springer Vienna 🌐 English ⚖ 698 KB

The cyclic compact open-shop scheduling

The cyclic compact open-shop scheduling problem

✍ N.V.R. Mahadev; Ph. Solot; D. de Werra 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 354 KB