Scheduling UET task systems with concurrency on two parallel identical processors

DOI10.1007/s001860000089zbMath1023.90023OpenAlexW2082077407MaRDI QIDQ1401638

Peter Brucker, Yakov Zinder, Duncan Roper, Sigrid Knust

Publication date: 18 August 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860000089

zbMATH Keywords

complexityschedulingapproximation algorithmconcurrencyidentical parallel processorsNP-hardnersunit execution time tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (9)

Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ Integration of routing into a resource-constrained project scheduling problem ⋮ A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ Scheduling multiprocessor tasks on parallel processors with limited availability. ⋮ Hybrid flow-shop scheduling problems with multiprocessor task systems. ⋮ A note on scheduling multiprocessor tasks with identical processing times. ⋮ Computational complexity of some scheduling problems with multiprocessor tasks ⋮ Scheduling multiprocessor UET tasks of two sizes ⋮ Scheduling multiprocessor tasks on two parallel processors

This page was built for publication: Scheduling UET task systems with concurrency on two parallel identical processors