𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A decomposition algorithm for the single machine total tardiness problem

✍ Scribed by C.N Potts; L.N Van Wassenhove

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
533 KB
Volume
1
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

A hybrid algorithm for the one machine s
A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
✍ V. Srinivasan πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio