✦ LIBER ✦

A genetic algorithm approach for a single hoist scheduling problem with time windows constraints

✍ Scribed by Amraoui, Adnen El; Manier, Marie-Ange; Moudni, Abdellah El; Benrejeb, Mohamed

Book ID: 120399081
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 575 KB
Volume: 26
Category: Article
ISSN: 0952-1976
DOI: 10.1016/j.engappai.2013.02.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cyclic scheduling of a hoist with time w

Cyclic scheduling of a hoist with time window constraints

✍ Haoxun Chen, ; Chengbin Chu, ; Proth, J.-M. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 305 KB

Algorithms for the Vehicle Routing and S

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

✍ Solomon, Marius M. 📂 Article 📅 1987 🏛 INFORMS 🌐 English ⚖ 669 KB

Algorithms for the Vehicle Routing and S

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

✍ Marius M. Solomon 📂 Article 📅 1987 🏛 INFORMS 🌐 English ⚖ 370 KB

A heuristic algorithm for the two-hoist

A heuristic algorithm for the two-hoist cyclic scheduling problem with overlapping hoist coverage ranges

✍ Zhou, Zhili; Liu, Jiyin 📂 Article 📅 2008 🏛 Taylor and Francis Group 🌐 English ⚖ 283 KB

Effective Local Search Algorithms for Ro

Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

✍ Ibaraki, T.; Imahori, S.; Kubo, M.; Masuda, T.; Uno, T.; Yagiura, M. 📂 Article 📅 2005 🏛 INFORMS 🌐 English ⚖ 471 KB

A genetic algorithm for a single hoist s

A genetic algorithm for a single hoist scheduling in the printed-circuit-board electroplating line

✍ Joon-Mook Lim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 352 KB

In this paper, the problem of determining cyclic schedules for a material handling hoist in the printedcircuit-board(PCB) electroplating line is considered. The objective of this research is to determine an optimal simple-cycle schedule of the hoist which in turn maximizes the line throughput rate.