✦ LIBER ✦

Competitive Analysis of a Better On-line Algorithm to Minimize Total Completion Time on a Single-machine

✍ Scribed by Jairo R. Montoya-Torres

Book ID: 111544117
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 72 KB
Volume: 27
Category: Article
ISSN: 0925-5001
DOI: 10.1023/a:1024693103802

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on “Competitive analysis of a b

Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine”

✍ Jiping Tao; Zhijun Chao; Yugeng Xi 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 129 KB

On-line scheduling on a single machine:

On-line scheduling on a single machine: minimizing the total completion time

✍ Amos Fiat; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 65 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

MINIMIZING TOTAL WEIGHTED COMPLETION TIM

MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON A SINGLE BATCH PROCESSING MACHINE

✍ Reha Uzsoy; Yaoyu Yang 📂 Article 📅 2009 🏛 Production and Operations Management Society 🌐 English ⚖ 344 KB

Robust scheduling on a single machine to

Robust scheduling on a single machine to minimize total flow time

✍ Chung-Cheng Lu; Shih-Wei Lin; Kuo-Ching Ying 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 250 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