Edge-Chromatic Scheduling with Simultaneity Constraints
From MaRDI portal
Publication:4302272
DOI10.1137/0406048zbMath0802.90059OpenAlexW2032073491MaRDI QIDQ4302272
Uri N. Peled, Dominique de Werra, N. V. R. Mahadev
Publication date: 14 August 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0406048
recognition algorithmedge-coloring modelchromatic schedulingautomated production systemsimultaneity constraints
Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
Preassignment requirements in chromatic scheduling, Open shop scheduling with some additional constraints, Restrictions and preassignments in preemptive open shop scheduling, Four decades of research on the open-shop scheduling problem to minimize the makespan, Implementation of a university course and examination timetabling system, Extensions of coloring models for scheduling purposes, The combinatorics of timetabling
