๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A special case of the single-machine total tardiness problem is NP-hard

โœ Scribed by E. R. Gafarov; A. A. Lazarev

Book ID
111453530
Publisher
SP MAIK Nauka/Interperiodica
Year
2006
Tongue
English
Weight
249 KB
Volume
45
Category
Article
ISSN
1064-2307

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solution of the single machine total tar
Solution of the single machine total tardiness problem
โœ Wlodzimierz Szwarc; Federico Della Croce; Andrea Grosso ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer US ๐ŸŒ English โš– 129 KB ๐Ÿ‘ 2 views

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

Algorithmic paradoxes of the single-mach
Algorithmic paradoxes of the single-machine total tardiness problem
โœ 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