Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
Year of publication: |
2014
|
---|---|
Authors: | Yan, Pengyu ; Che, Ada ; Cai, Xiaoqiang ; Tang, Xiaowo |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 50.2014, p. 128-140
|
Subject: | Robotic cells rescheduling | Limited disturbance | Branch and bound algorithm | Dynamic enumeration | Search strategy | Roboter | Robot | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem | Fertigungsinsel | Cellular manufacturing | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Yan, Pengyu, (2010)
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
- More ...
-
Yan, Pengyu, (2010)
-
Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
Che, Ada, (2010)
-
Yan, Pengyu, (2012)
- More ...