✦ LIBER ✦

Scheduling jobs to two machines subject to batch arrival ordering

✍ Scribed by Arie Tamir

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 410 KB
Volume: 26
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800260313

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The problem considered is to assign n jobs to two processors so as to minimize the total flow time, with the constraint that a predetermined partial ordering (induced by batch arrivals) must be preserved within the subset of jobs assigned to each processor. An efficient algorithm of time 0(n^5^) is developed, and computational experience is reported.

📜 SIMILAR VOLUMES

Single machine parallel batch scheduling

Single machine parallel batch scheduling subject to precedence constraints

✍ T.C.E. Cheng; C.T. Ng; J.J. Yuan; Z.H. Liu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

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

Scheduling stochastic jobs on a single m

Scheduling stochastic jobs on a single machine subject to breakdowns

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

Single machine scheduling to minimize we

Single machine scheduling to minimize weighted earliness subject to no tardy jobs

✍ Suresh Chand; Hans Schneeberger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 676 KB

Order-preserving allocation of jobs to t

Order-preserving allocation of jobs to two machines

✍ S. Mehta; R. Chandraseharan; H. Emmons 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 156 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