Restrictions and preassignments in preemptive open shop scheduling

DOI10.1016/0166-218X(95)00055-VzbMath0846.90056MaRDI QIDQ1917354

Dominique de Werra, N. V. R. Mahadev, Uri N. Peled, Alan J. Hoffman

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge coloringtimetablingbipartite multigraphpreemptive open shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Related Items

Restricted coloring models for timetabling, Preassignment requirements in chromatic scheduling, Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations, Improved approximation algorithms for the max edge-coloring problem, Four decades of research on the open-shop scheduling problem to minimize the makespan, Approximating the max-edge-coloring problem, On the Maximum Edge Coloring Problem, Extensions of coloring models for scheduling purposes, The combinatorics of timetabling, What is my objective function?, On a multiconstrained model for chromatic scheduling, On perfectness of sums of graphs, Edge dominating set and colorings on graphs with fixed clique-width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Some results concerning the complexity of restricted colorings of graphs
• Interval edge coloring of a graph with forbidden colors
• On the Complexity of Timetable and Multicommodity Flow Problems
• Edge-Chromatic Scheduling with Simultaneity Constraints
• Lattice Polyhedra II: Generalization, Constructions and Examples
• Balanced matrices
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs