✦ LIBER ✦

Parallel machine scheduling: A probabilistic analysis

✍ Scribed by Nanda Piersma; H. Edwin Romeijn

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 745 KB
Volume: 43
Category: Article
ISSN: 0894-069X
DOI: 10.1002/(sici)1520-6750(199609)43:6<897::aid-nav7>3.0.co;2-#

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel machine scheduling with job ass

Parallel machine scheduling with job assignment restrictions

✍ Celia A. Glass; Hans Kellerer 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means

Scheduling a maintenance activity on par

Scheduling a maintenance activity on parallel identical machines

✍ Asaf Levin; Gur Mosheiov; Assaf Sarig 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

## Abstract We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required

Parallel machine batching and scheduling

Parallel machine batching and scheduling with deadlines

✍ T. C. Edwin Cheng; Mikhail Y. Kovalyov 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 137 KB 👁 1 views

In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated parallel machines. Each job j has a processing time and a deadline, the time at which the job must be completed. On each machine, jobs may be grouped to form batches containing continuously scheduled

Approximation schemes for scheduling on

Approximation schemes for scheduling on parallel machines

✍ Noga Alon; Yossi Azar; Gerhard J. Woeginger; Tal Yadid 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 124 KB 👁 1 views

We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which

Scheduling for parallel dedicated machin

Scheduling for parallel dedicated machines with a single server

✍ Celia A. Glass; Yakov M. Shafransky; Vitaly A. Strusevich 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 443 KB 👁 1 views

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two paralle

Scheduling jobs and maintenance activiti

Scheduling jobs and maintenance activities on parallel machines

✍ Chung-Yee Lee; Zhi-Long Chen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machin