✦ LIBER ✦

Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

✍ Scribed by S. V. Sevastyanov; R. A. Sitters; A. V. Fishkin

Book ID: 110153225
Publisher: SP MAIK Nauka/Interperiodica
Year: 2010
Tongue: English
Weight: 180 KB
Volume: 71
Category: Article
ISSN: 0005-1179
DOI: 10.1134/s0005117910100085

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preemptive scheduling of independent job

Preemptive scheduling of independent jobs on parallel machines subject to financial constraints

✍ Roman Slowiński 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Online scheduling of two type parallel j

Online scheduling of two type parallel jobs on identical machines

✍ Shou-wei Guo; Li-ying Kang 📂 Article 📅 2010 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 142 KB

Optimal preemptive scheduling on a fixed

Optimal preemptive scheduling on a fixed number of identical parallel machines

✍ Aziz Moukrim; Alain Quilliot 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Scheduling independent jobs on uniform p

Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria

✍ Alain Guinet 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 684 KB

Single-machine scheduling of stochastic

Single-machine scheduling of stochastic jobs subject to deterioration or delay

✍ K. D. Glazebrook 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 914 KB

Scheduling identical jobs with unequal r

Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness

✍ Maged M. Dessouky 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 308 KB

AbstractÐWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that