๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one

โœ Scribed by Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner

Book ID
111926566
Publisher
Springer US
Year
2012
Tongue
English
Weight
579 KB
Volume
196
Category
Article
ISSN
0254-5330

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

Polynomial time algorithms for minimizin
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
โœ Philippe Baptiste ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer US ๐ŸŒ English โš– 102 KB ๐Ÿ‘ 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t