𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time

✍ Scribed by Ma, Ran; Yuan, Jinjiang

Book ID
127387395
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
283 KB
Volume
158
Category
Article
ISSN
0925-5273

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