Compactness and balancing in scheduling

DOI10.1007/BF01918457zbMath0368.90092OpenAlexW1985048086MaRDI QIDQ4145144

Dominique de Werra, Daniel Brélaz, Y. Nicolier

Publication date: 1977

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01918457

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35)

Related Items

Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem, A DSATUR-based algorithm for the equitable coloring problem, A Tabu Search Heuristic for the Equitable Coloring Problem, A generalization of interval edge-colorings of graphs, Chromatic optimisation: Limitations, objectives, uses, references, Some sequential graph colouring algorithms

Cites Work

• On A Particular Conference Scheduling Problem
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• The Solution of a Timetabling Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item