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 ✦
Fast neighborhood search for the single machine total weighted tardiness problem
✍ Scribed by Özlem Ergun; James B. Orlin
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 154 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0167-6377
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
A decomposition algorithm for the single
✍
C.N Potts; L.N Van Wassenhove
📂
Article
📅
1982
🏛
Elsevier Science
🌐
English
⚖ 533 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
Dynamic programming and decomposition ap
✍
C.N. Potts; L.N. Van Wassenhove
📂
Article
📅
1987
🏛
Elsevier Science
🌐
English
⚖ 909 KB
A heuristic for the single machine tardi
✍
S.S. Panwalkar; M.L. Smith; C.P. Koulamas
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 518 KB
Worst-case analysis of local search heur
✍
Shiwei Chang; Hirofumi Matsuo; Guochun Tang
📂
Article
📅
1990
🏛
John Wiley and Sons
🌐
English
⚖ 538 KB