Deadline scheduling of tasks with ready times and resource constraints

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1016/0020-0190(79)90143-1" rel="nofollow">DOI 10.1016/0020-0190(79)90143-1</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/0401.90048" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://dblp.org/rec/journals/ipl/Blazewicz79" rel="nofollow">DBLP</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W1985064863" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--grey" href="https://www.wikidata.org/wiki/Q57387941" rel="nofollow"><img src="https://www.wikidata.org/static/favicon/wikidata.ico" class="pub-badge-icon" alt=""/>Wikidata</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q1255432" rel="nofollow">MaRDI QID Q1255432</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q1255432" rel="nofollow">FDO</a>

Authors 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

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

Cited in

(11)

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

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)