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

On decomposition of the total tardiness problem

โœ Scribed by S. Chang; Q. Lu; G. Tang; W. Yu

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
592 KB
Volume
17
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Decomposition and hybrid simulated annea
Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
โœ Christos Koulamas ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB ๐Ÿ‘ 2 views

A polynomial decomposition heuristic is developed for the parallel-machine tardiness problem (P//T V ) by extending the decomposition principle embedded in the single-machine tardiness problem (1//T V ) to a parallel-machine setting. The subproblems generated by the decomposition are solved by an ef

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