On Scheduling Independent Tasks with Restricted Execution Times

DOI10.1287/OPRE.30.1.163MaRDI QIDQ3939585zbMATH OpenOpenAlexFDO

Authors Joseph Y.-T. Leung

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

zbMATH Keywords

minimization of overall completion timenonpreemptively scheduling n independent tasks on m identical and parallel machinesNP-completenesspolynomial algorithmrestricted execution times

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(14)

• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• Scheduling tree-structured tasks with restricted execution times
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• On the complexity of scheduling with large communication delays
• Packet scheduling in third-generation mobile systems with UTRA-TDD air interface
• An asymptotically exact algorithm for the high-multiplicity bin packing problem
• On-line scheduling with setup costs
• Exact and approximate algorithms for high-multiplicity scheduling with rejection on parallel machines
• 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
• Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
• A state-of-the-art review of parallel-machine scheduling research
• An approximate algorithm for a high-multiplicity parallel machine scheduling problem

This page was built for publication: On Scheduling Independent Tasks with Restricted Execution Times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3939585)