𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic programming and decomposition approaches for the single machine total tardiness problem

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

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
909 KB
Volume
32
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Decomposition and hybrid simulated annea
Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
✍ Christos Koulamas πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 93 KB πŸ‘ 2 views

A polynomial decomposition heuristic is developed for the parallel-machine tardiness problem (P//T V ) by extending the decomposition principle embedded in the single-machine tardiness problem (1//T V ) to a parallel-machine setting. The subproblems generated by the decomposition are solved by an ef

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