A novel fill-time window minimisation problem and adaptive parallel tabu search algorithm in mail-order pharmacy automation system
Year of publication: |
2015
|
---|---|
Authors: | Li, Debiao ; Yoon, Sang Won |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 53.2015, 14 (15.7.), p. 4189-4205
|
Subject: | mail-order pharmacy automation system | fill-time window | adaptive parallel tabu search | parallel machines optimisation | Heuristik | Heuristics | Automatisierung | Automation | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Automatisierte Produktion | Automated manufacturing |
-
Scheduling of deadlock and failure-prone automated manufacturing systems via hybrid heuristic search
Luo, Jian Chao, (2017)
-
Flexible robotic manufacturing cell scheduling problem with multiple robots
Yang, Yujun, (2016)
-
A hybrid metaheuristic algorithm to optimise a real-world robotic cell
Liu, Shi Qiang, (2017)
- More ...
-
Dauod, Husam, (2023)
-
Li, Debiao, (2021)
-
Zhou, Shenghai, (2021)
- More ...