Bounded colouring motivated by the limited resource partially concurrent open shop problem
From MaRDI portal
Publication:2241155
DOI10.1007/s10479-019-03503-9zbMath1476.90121OpenAlexW2995190842MaRDI QIDQ2241155
Elad Shufan, Tal Grinshpoun, Hagai Ilani
Publication date: 8 November 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03503-9
graph colouringopen shop schedulinglimited resourcestechnician timetablingbounded colouringconcurrent machines
Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Bounded vertex colorings of graphs
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
- Restricted coloring models for timetabling
- Partially concurrent open shop scheduling with integral preemptions
- Coloring graph products---a survey
- The representation of partially-concurrent open shop problems
- Some graphical properties of matrices with non-negative entries
- Solving the minimum-weighted coloring problem
- Graph Theory
- Graphs with Given Group and Given Graph-Theoretical Properties
- Bounded Stable Sets: Polytopes and Colorings
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- An upper bound for the chromatic number of a graph and its application to timetabling problems
This page was built for publication: Bounded colouring motivated by the limited resource partially concurrent open shop problem