Parallel machine scheduling with a common server
Parallel machine scheduling with a common server
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.
deterministic parallel machine scheduling, common server, polynomial-time algorithm, np-complete
223-243
Hall, Nicholas G.
150c925d-8d57-40f8-9bfe-01ccb34cebc6
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Sriskandarajah, Chelliah
b3becb96-781c-4102-8289-c5b6eda0065e
2000
Hall, Nicholas G.
150c925d-8d57-40f8-9bfe-01ccb34cebc6
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Sriskandarajah, Chelliah
b3becb96-781c-4102-8289-c5b6eda0065e
Hall, Nicholas G., Potts, Chris N. and Sriskandarajah, Chelliah
(2000)
Parallel machine scheduling with a common server.
Discrete Applied Mathematics, 102 (3), .
(doi:10.1016/S0166-218X(99)00206-1).
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.
This record has no associated files available for download.
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: 15 Mar 2024 07:33
Export record
Altmetrics
Contributors
Author:
Nicholas G. Hall
Author:
Chelliah Sriskandarajah
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