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).


Full text not available from this repository.


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.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/S0166-218X(99)00206-1
ISSNs: 0166-218X (print)
Keywords: deterministic parallel machine scheduling, common server, polynomial-time algorithm, np-complete
Organisations: Operational Research
ePrint ID: 29614
Date :
Date Event
Date Deposited: 11 May 2006
Last Modified: 16 Apr 2017 22:22
Further Information:Google Scholar

Actions (login required)

View Item View Item