✦ LIBER ✦

Complexity results for parallel machine problems with a single server

✍ Scribed by Peter Brucker; Clarisse Dhaenens-Flipo; Sigrid Knust; Svetlana A. Kravchenko; Frank Werner

Publisher: Springer US
Year: 2002
Tongue: English
Weight: 270 KB
Volume: 5
Category: Article
ISSN: 1094-6136
DOI: 10.1002/jos.120

No coin nor oath required. For personal study only.

✦ Synopsis

Parallel machine problems with a single server are generalizations of classical parallel machine problems. Immediately before processing, each job must be loaded on a machine, which takes a certain set-up time. All these set-ups have to be done by a single server which can handle at most one job at a time. In this paper we continue studying the complexity aspects of server problems begun in Hall et al.

📜 SIMILAR VOLUMES

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

Do bilineal pedigrees represent a proble

Do bilineal pedigrees represent a problem for linkage analysis? basic principles and simulation results for single-gene diseases with no heterogeneity

✍ Dr. Susan E. Hodge; J. J. Mulvihill 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 840 KB

Some investigators have expressed concem-zspecially for psychiatric disordersthat bilineal pedigrees should not be included in linkage studies. This study compares the "informativeness" of bilineal and unilineal families for a homogeneous single-gene disorder. Three approaches were used: (1) simulat