A theoretical development for the total tardiness problem and its application in branch and bound algorithm
Year of publication: |
2013
|
---|---|
Authors: | Zhou, Shuyu ; Liu, Zhaohui |
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. 40.2013, 1, p. 248-252
|
Subject: | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research | Branch-and-Bound | Branch and Bound | USA | United States | Theorie | Theory | Algorithmus | Algorithm |
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines
Hazır, Öncü, (2021)
-
A branch-and-bound algorithm for shift scheduling with nonstationary demand
Defraeye, Mieke, (2013)
- More ...
-
Tactical fixed job scheduling with spread-time constraints
Zhou, Shuyu, (2014)
-
Increasing the revenue of self-storage warehouses by optimizing order scheduling
Zhang, Xiandong, (2016)
-
Designing self-storage warehouses with customer choice
Zhou, Shuyu, (2016)
- More ...