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 |
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
-
Álvarez-Miranda, Eduardo, (2024)
-
Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
Yu, Jae-Min, (2018)
- More ...
-
Alfieri, Arianna, (2021)
-
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 ...