Scheduling UET task systems with concurrency on two parallel identical processors
From MaRDI portal
Publication:1401638
DOI10.1007/s001860000089zbMath1023.90023MaRDI QIDQ1401638
Peter Brucker, Sigrid Knust, Yakov Zinder, Duncan Roper
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
complexity; scheduling; approximation algorithm; concurrency; identical parallel processors; NP-hardners; unit execution time tasks
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
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., Scheduling multiprocessor tasks on two parallel processors