Scheduling with Concurrency-Based Constraints

DOI10.1006/JAGM.1995.1003MaRDI QIDQ4327815zbMATH OpenOpenAlexFDO

Authors Bonnie Berger, Lenore J. Cowen

Publication date 9 April 1995

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5f5dd2b489097dd684d566bbbc9b49734796b03a

zbMATH Keywords

scheduling problems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Scheduling with semaphore constraints
• UET-scheduling with constrained processor allocations
• Scheduling with constrained processor allocation for interval orders
• Scheduling UET task systems with concurrency on two parallel identical processors
• Parallel processor scheduling with delay constraints

Cited in

(7)

• Scheduling with semaphore constraints
• Constraints meet concurrency
• scientific article; zbMATH DE number 9346 (Why is no real title available?)
• scientific article; zbMATH DE number 2080325 (Why is no real title available?)
• Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach
• Scheduling Jobs with Temporal Distance Constraints
• Optimizing concurrency under Scheduling by Edge Reversal

This page was built for publication: Scheduling with Concurrency-Based Constraints

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