✦ LIBER ✦

Randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors

✍ Scribed by Dong-lei Du

Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2005
Tongue: English
Weight: 108 KB
Volume: 21
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s10255-005-0255-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling jobs with release dates and t

Scheduling jobs with release dates and tails on identical machines to minimize the makespan

✍ Jacques Carlier 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 618 KB

Rescheduling to minimize makespan on a c

Rescheduling to minimize makespan on a changing number of identical processors

✍ Craig A. Tovey 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB

Scheduling deteriorating jobs to minimiz

Scheduling deteriorating jobs to minimize the makespan on a single machine

✍ Chin-Chia Wu; Yau-Ren Shiau; Ling-Huei Lee; Wen-Chiung Lee 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 153 KB

On-line scheduling on a batch machine to

On-line scheduling on a batch machine to minimize makespan with limited restarts

✍ Ruyan Fu; Ji Tian; Jinjiang Yuan; Cheng He 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Job scheduling to minimize expected weig

Job scheduling to minimize expected weighted flowtime on uniform processors

✍ Rhonda Righter 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Scheduling linear deteriorating jobs to

Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine

✍ Chin-Chia Wu; Wen-Chiung Lee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 74 KB

The scheduling problem with deteriorating jobs to minimize the makespan on a single machine where the facility has an availability constraint is studied in this paper. By a deteriorating job we mean that the processing time for the job is a function of its starting time. Even with the introduction o