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

Approximation algorithms for scheduling a single machine to minimize total late work

โœ Scribed by C.N Potts; L.N Van Wassenhove

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
488 KB
Volume
11
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling of a single machine to minimi
Scheduling of a single machine to minimize total weighted completion time subject to release dates
โœ Lucio Bianco; Salvatore Ricciardelli ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 764 KB

## Abstract In this paper the __n__/1/__r__~j~ ฮฃ~j~ __w__~__j__~ __C__~__j__~ problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are