Scheduling jobs on identical machines with agreement graph
From MaRDI portal
Publication:1761988
DOI10.1016/j.cor.2011.04.014zbMath1251.90115MaRDI QIDQ1761988
Mourad Boudhar, Mohamed Bendraouche
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.04.014
05C90: Applications of graph theory
90B35: Deterministic scheduling theory in operations research
90B60: Marketing, advertising
Related Items
Storage Yard Management: Modelling and Solving, Approximation of the parallel machine scheduling problem with additional unit resources, Flow shop scheduling problem with conflict graphs, Scheduling identical jobs on uniform machines with a conflict graph, 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, Scheduling: agreement graph vs resource constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Restrictions of graph partition problems. I
- Bounded vertex colorings of graphs
- A note on the decomposition of graphs into isomorphic matchings
- Scheduling with conflicts: Online and offline algorithms
- Mutual exclusion scheduling with interval graphs or related classes. I
- The complexity of generalized clique packing
- NP-completeness of graph decomposition problems
- Stable sets and polynomials
- Restricted coloring models for timetabling
- Mutual exclusion scheduling
- Matching and multidimensional matching in chordal and strongly chordal graphs
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Multicoloring trees.
- A note on greedy algorithms for the maximum weighted independent set problem
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Mathematical Foundations of Computer Science 2004
- Bounds for Certain Multiprocessing Anomalies
- Bounded vertex coloring of trees
