The University of Southampton
University of Southampton Institutional Repository

Parallel machine scheduling with a common server

Hall, Nicholas G., Potts, Chris N. and Sriskandarajah, Chelliah (2000) Parallel machine scheduling with a common server Discrete Applied Mathematics, 102, (3), pp. 223-243. (doi:10.1016/S0166-218X(99)00206-1).

Record type: Article

Abstract

This paper considers the nonpreemptive scheduling of a given set of jobs on several identical, parallel machines. Each job must be processed on one of the machines. Prior to processing, a job must be loaded (setup) by a single server onto the relevant machine. The paper considers a number of classical scheduling objectives in this environment, under a variety of assumptions about setup and processing times. For each problem considered, the intention is to provide either a polynomial- or pseudo-polynomial-time algorithm, or a proof of binary or unary NP-completeness. The results provide a mapping of the computational complexity of these problems.

Full text not available from this repository.

More information

Published date: 2000
Keywords: deterministic parallel machine scheduling, common server, polynomial-time algorithm, np-complete
Organisations: Operational Research

Identifiers

Local EPrints ID: 29614
URI: http://eprints.soton.ac.uk/id/eprint/29614
ISSN: 0166-218X
PURE UUID: 8f1dcac8-3e26-47d0-b6b4-fc45ec5d35a4

Catalogue record

Date deposited: 11 May 2006
Last modified: 17 Jul 2017 15:57

Export record

Altmetrics

Contributors

Author: Nicholas G. Hall
Author: Chris N. Potts
Author: Chelliah Sriskandarajah

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×