𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for the single machine tardiness problem

✍ Scribed by Suna Kondakci; Ömer Kirca; Meral Azizoǧlu

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
553 KB
Volume
36
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An experimental comparison of solution a
An experimental comparison of solution algorithms for the single-machine tardiness problem
✍ Kenneth R. Baker; James B. Martin 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 778 KB

## Abstract A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A nu

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