Skip navigation

Scheduling parallel dedicated machines under a single non-shared resource

Scheduling parallel dedicated machines under a single non-shared resource

Kelleler, H. and Strusevich, V.A. (2002) Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research, 147 (2). pp. 345-364. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(02)00246-1)

Full text not available from this repository.

Abstract

The scheduling problem of minimizing the makespan for m parallel dedicated machines under single resource constraints is considered. For different variants of the problem the complexity status is established. Heuristic algorithms employing the so-called group technology approach are presented and their worst-case behavior is examined. Finally, a polynomial time approximation scheme is presented for the problem with fixed number of machines.

Item Type: Article
Additional Information: [1] Accepted: 15 February 2002. [2] First published online: 9 April 2002.
Uncontrolled Keywords: parallel dedicated machines, non-shared resources, complexity, approximation, worst-case analysis
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Pre-2014 Departments: School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
School of Computing & Mathematical Sciences > Statistics & Operational Research Group
Related URLs:
Last Modified: 14 Oct 2016 09:01
URI: http://gala.gre.ac.uk/id/eprint/655

Actions (login required)

View Item View Item