✦ LIBER ✦

On-line scheduling of unit time jobs with rejection: minimizing the total completion time

✍ Scribed by Leah Epstein; John Noga; Gerhard J. Woeginger

Book ID: 108410457
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 142 KB
Volume: 30
Category: Article
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(02)00160-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-Line Scheduling of Unit Time Jobs wit

On-Line Scheduling of Unit Time Jobs with Rejection on Uniform Machines

✍ Shoupeng Liu; Yuzhong Zhang 📂 Article 📅 2008 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 139 KB

Minimizing the total completion time in

Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs

✍ A.A.K. Jeng; B.M.T. Lin 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 343 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

Minimizing the total weighted completion

Minimizing the total weighted completion time of deteriorating jobs

✍ Aleksander Bachman; Adam Janiak; Mikhail Y. Kovalyov 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 53 KB

On-Line Scheduling a Batch Processing Sy

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time

✍ Bo Chen; Xiaotie Deng; Wenan Zang 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 97 KB

Three scheduling problems with deteriora

Three scheduling problems with deteriorating jobs to minimize the total completion time

✍ C.T. Ng; T.C.E. Cheng; A. Bachman; A. Janiak 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 84 KB

In this paper, three scheduling problems with deteriorating jobs to minimize the total completion time on a single machine are investigated. By a deteriorating job, we mean that the processing time of the job is a function of its execution start time. The three problems correspond to three different