Preemptive Scheduling of Hybrid Parallel Machines

Anantaram Balakrishnan
Additional contact information
Anantaram Balakrishnan: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1989, vol. 37, issue 2, 301-313

Abstract: Multioperation production facilities are often segmented into independent workcells that handle different subsets of operations. We refer to a cell that consists of several groups of uniform special purpose machines, each capable of performing only one particular operation, and one group of identical general purpose machines, that can perform all the required operations at a slower rate, as a hybrid parallel machine environment. This paper focuses on deterministic, preemptive scheduling in such an environment. We first analyze the minimum makespan for a preemptive schedule when all jobs arrive simultaneously at a hybrid machine facility. For the more general situation where jobs have arbitrary release and due dates, we adapt a network flow formulation, originally proposed for the uniform machines case, to determine whether all jobs can be completed feasibly before their respective due dates.

Keywords: networks/graphs; applications: preemptive scheduling of parallel machines; production/scheduling: using max flow algorithms for scheduling parallel machines (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.2.301 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:2:p:301-313

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().