Deadline scheduling of tasks with ready times and resource constraints

DOI10.1016/0020-0190(79)90143-1zbMATH Open0401.90048DBLPjournals/ipl/Blazewicz79OpenAlexW1985064863WikidataQ57387941 ScholiaQ57387941MaRDI QIDQ1255432FDOQ1255432

Jacek Blazewicz

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

zbMATH Keywords

Computational ComplexityDeadline SchedulingParallel ProcessorsReady TimesResource Constraints

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• On the computational power of pushdown automata
• Two-Processor Scheduling with Start-Times and Deadlines
• Title not available (Why is that?)
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• Title not available (Why is that?)
• Minimizing maximum lateness on one machine: computational experience and some applications
• Title not available (Why is that?)
• Simple algorithms for multiprocessor scheduling to meet deadlines

Cited In (11)

• Production, maintenance and resource scheduling: a review
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Scheduling tasks on two processors with deadlines and additional resources
• Restricted assignment scheduling with resource constraints
• Scheduling subject to resource constraints: Classification and complexity
• A linear time algorithm for restricted bin packing and scheduling problems
• Simulated annealing for resource-constrained scheduling
• Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
• On a periodic maintenance problem
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• Minimizing mean flow time with parallel processors and resource constraints

This page was built for publication: Deadline scheduling of tasks with ready times and resource constraints

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