𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A hybrid algorithm for the single-machine total tardiness problem

✍ Scribed by T.C.E. Cheng; A.A. Lazarev; E.R. Gafarov

Book ID
108105849
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
170 KB
Volume
36
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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