Scheduling: agreement graph vs resource constraints

DOI10.1016/J.EJOR.2014.07.003MaRDI QIDQ2629638zbMATH OpenOpenAlexFDO

Authors Mohamed Bendraouche, Mourad Boudhar, A. Oulamara

Publication date 6 July 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2014.07.003

zbMATH Keywords

agreement graphcomplexity theoryidentical machinesresource constraintsscheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Scheduling jobs on identical machines with agreement graph
• New results in two identical machines scheduling with agreement graphs
• New complexity results for shop scheduling problems with agreement graphs
• Scheduling of resource tasks
• Two-machine open shop problem with agreement graph

Cites work

• A linear time algorithm for restricted bin packing and scheduling problems
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• scientific article; zbMATH DE number 1640601 (Why is no real title available?)
• scientific article; zbMATH DE number 3757696 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Multicoloring trees.
• Mutual exclusion scheduling
• Mutual exclusion scheduling with interval graphs or related classes. I
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• Restrictions of graph partition problems. I
• Scheduling File Transfers
• Scheduling jobs on identical machines with agreement graph
• Scheduling multiprocessor tasks on three dedicated processors
• Scheduling subject to resource constraints: Classification and complexity
• Scheduling tasks on two processors with deadlines and additional resources
• Scheduling with conflicts: Online and offline algorithms
• The complexity of scheduling independent two-processor tasks on dedicated processors

Cited in

(7)

• Flow shop scheduling problem with conflict graphs
• Scheduling jobs on identical machines with agreement graph
• Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
• Two-machine open shop problem with agreement graph
• Open shop scheduling problems with conflict graphs
• New results in two identical machines scheduling with agreement graphs
• Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints

This page was built for publication: Scheduling: agreement graph vs resource constraints

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