✦ LIBER ✦

Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem

✍ Scribed by Federico Della Croce; Andrea Grosso; VangelisTh. Paschos

Book ID: 111594804
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 112 KB
Volume: 7
Category: Article
ISSN: 1094-6136
DOI: 10.1023/b:josh.0000013056.09936.fd

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Evaluation of leading heuristics for the

Evaluation of leading heuristics for the single machine tardiness problem

✍ Randolph M. Russell; J.Edward Holsenback 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Worst-case analysis of local search heur

Worst-case analysis of local search heuristics for the one-machine total tardiness problem

✍ Shiwei Chang; Hirofumi Matsuo; Guochun Tang 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

Lower bounds for the earliness–tardiness

Lower bounds for the earliness–tardiness scheduling problem on parallel machines with distinct due dates

✍ Safia Kedad-Sidhoum; Yasmin Rios Solis; Francis Sourd 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 217 KB

An Iterated Local Search heuristic for t

An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times

✍ Subramanian, Anand; Battarra, Maria; Potts, Chris N. 📂 Article 📅 2014 🏛 Taylor and Francis Group 🌐 English ⚖ 268 KB

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

Algorithms for solving the NP-hard probl

Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine

✍ A. A. Lazarev; A. G. Kvaratskheliya; E. R. Gafarov 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 185 KB