𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for single machine sequencing with release dates to minimize total weighted completion time

✍ Scribed by A.M.A. Hariri; C.N. Potts

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
721 KB
Volume
5
Category
Article
ISSN
0166-218X

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

A fully combinatorial 2-approximation al
A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
✍ N.N. Pisaruk πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 217 KB

We study the problem of scheduling a single machine with the precedence relation on the set of jobs to minimize average weighted completion time. The problem is strongly NP-hard. The ΓΏrst combinatorial 2-approximation algorithm for this scheduling problem was developed by the author in 1992 (in fact