On Scheduling Independent Tasks with Restricted Execution Times
From MaRDI portal
Publication:3939585
DOI10.1287/opre.30.1.163zbMath0481.90046OpenAlexW2003327526MaRDI QIDQ3939585
Publication date: 1982
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.30.1.163
NP-completenesspolynomial algorithmminimization of overall completion timenonpreemptively scheduling n independent tasks on m identical and parallel machinesrestricted execution times
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Optimal packet-to-slot assignment in mobile telecommunications, Batch scheduling of step deteriorating jobs, Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions, On-line scheduling with setup costs, Scheduling tree-structured tasks with restricted execution times, Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems, A state-of-the-art review of parallel-machine scheduling research, Packet scheduling in third-generation mobile systems with UTRA-TDD air interface, An approximate algorithm for a high-multiplicity parallel machine scheduling problem, Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems, On the complexity of scheduling with large communication delays, Exact and approximate algorithms for high-multiplicity parallel machine scheduling, An asymptotically exact algorithm for the high-multiplicity bin packing problem
