Deadline scheduling of tasks with ready times and resource constraints
From MaRDI portal
Publication:1255432
DOI10.1016/0020-0190(79)90143-1zbMath0401.90048OpenAlexW1985064863WikidataQ57387941 ScholiaQ57387941MaRDI QIDQ1255432
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90143-1
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Scheduling tasks on two processors with deadlines and additional resources, Minimizing mean flow time with parallel processors and resource constraints, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, Solving the resource constrained deadline scheduling problem via reduction to the network flow problem, Restricted assignment scheduling with resource constraints, On a periodic maintenance problem, A linear time algorithm for restricted bin packing and scheduling problems, Scheduling subject to resource constraints: Classification and complexity, Production, maintenance and resource scheduling: a review, Simulated annealing for resource-constrained scheduling, Parallel machine scheduling with additional resources: notation, classification, models and solution methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple algorithms for multiprocessor scheduling to meet deadlines
- On the computational power of pushdown automata
- Minimizing maximum lateness on one machine: computational experience and some applications
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Two-Processor Scheduling with Start-Times and Deadlines
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
