𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic for the single machine tardiness problem

✍ Scribed by S.S. Panwalkar; M.L. Smith; C.P. Koulamas

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
518 KB
Volume
70
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on β€œBeam search heuristics for th
A note on β€œBeam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”
✍ F. Della Croce; E. Desmier; T. Garaix πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 171 KB

In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time" ', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earlinesstard

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