✦ LIBER ✦

Reducibility among single machine weighted completion time scheduling problems

✍ Scribed by Marc E. Posner

Book ID: 112718210
Publisher: Springer US
Year: 1990
Tongue: English
Weight: 463 KB
Volume: 26
Category: Article
ISSN: 0254-5330
DOI: 10.1007/bf02248586

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine scheduling problem with i

Single machine scheduling problem with interval processing times to minimize mean weighted completion time

✍ Allahverdi, Ali; Aydilek, Harun; Aydilek, Asiye 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 595 KB

Unrelated parallel-machine scheduling to

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

Fabrication scheduling on a single machi

Fabrication scheduling on a single machine to minimize the weighted sum of product completion time

✍ Yu-qing Wang; Shi-jie Sun 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 204 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

Online tradeoff scheduling on a single m

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

✍ Ma, Ran; Yuan, Jinjiang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Single-machine scheduling problems with

Single-machine scheduling problems with time and

✍ Xingong Zhang; Guangle Yan; Wanzhen Huang; Guochun Tang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 451 KB