✦ LIBER ✦

A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time

✍ Scribed by Tao, Jiping

Book ID: 121306904
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 685 KB
Volume: 43
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2013.09.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unrelated parallel-machine scheduling to

✍ Chen, Jeng-Fung 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 435 KB

An optimal online algorithm for single m

An optimal online algorithm for single machine scheduling to minimize total general completion time

✍ Ming Liu; Chengbin Chu; Yinfeng Xu; Jiazhen Huo 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 335 KB

A note on “An optimal online algorithm f

A note on “An optimal online algorithm for single machine scheduling to minimize total general completion time”

✍ Sheng Yu; Prudence W.H. Wong 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Unrelated parallel-machine scheduling wi

✍ Wang, Li-Yan; Huang, Xue; Ji, Ping; Feng, En-Min 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 152 KB

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

An improved branch and bound algorithm f

An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time

✍ Yunpeng Pan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 173 KB