Scheduling preemptable tasks on parallel processors with limited availability

DOI10.1016/S0167-8191(00)00035-1zbMath0945.68015OpenAlexW2066848916WikidataQ57387838 ScholiaQ57387838MaRDI QIDQ1575603

Wiesław X. Kubiak, Jacek Błażewicz, Maciej Drozdowski, Günter Schmidt, Piotr Formanowicz

Publication date: 21 August 2000

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00035-1

zbMATH Keywords

computational complexitylinear programmingpreemptive schedulingparallel processorslimited machine availability

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Scheduling jobs in open shops with limited machine availability, Parallel machine scheduling with machine availability and eligibility constraints, Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints, A survey of due-date related single-machine with two-agent scheduling problem, Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques, Routing equal-size messages on a slotted ring, Approximation schemes for parallel machine scheduling with availability constraints, Online scheduling on semi-related machines, New applications of the Muntz and Coffman algorithm, Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints, Minimizing maximum tardiness in single FMS machine scheduling with tool changes, Makespan minimization for parallel machines scheduling with multiple availability constraints, Exponential inapproximability and FPTAS for scheduling with availability constraints