The paper deals with the solution of the single machine total tardiness model. It improves and generalizes an important rule to decompose the model into two subproblems. It also provides a O(n) procedure to implement this rule and its generalization. Those two rules, along with some known results, a
โฆ LIBER โฆ
On the single machine total tardiness problem
โ Scribed by Z.J. Tian; C.T. Ng; T.C.E. Cheng
- Book ID
- 108116808
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 253 KB
- Volume
- 165
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Solution of the single machine total tar
โ
Wlodzimierz Szwarc; Federico Della Croce; Andrea Grosso
๐
Article
๐
1999
๐
Springer US
๐
English
โ 129 KB
๐ 2 views
Decomposition of the single machine tota
โ
Wlodzimierz Szwarc; Samar K. Mukhopadhyay
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 497 KB
Algorithmic paradoxes of the single-mach
โ
Wlodzimierz Szwarc; Andrea Grosso; Federico Della Croce
๐
Article
๐
2001
๐
Springer US
๐
English
โ 108 KB
The paper deals with the single-machine total tardiness problem. It investigates the authors' most recent branch and bound algorithm and discovers the following paradoxes. Deleting a lower bound drastically improves the performance of the algorithm, while adding a stronger component, like a better d
A decomposition algorithm for the single
โ
C.N Potts; L.N Van Wassenhove
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 533 KB
The single-machine total tardiness sched
โ
Christos Koulamas
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 233 KB
A hybrid algorithm for the single-machin
โ
T.C.E. Cheng; A.A. Lazarev; E.R. Gafarov
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 170 KB