Compactness and balancing in scheduling

DOI10.1007/BF01918457MaRDI QIDQ4145144zbMATH OpenOpenAlexFDO

Authors Daniel Brélaz, Y. Nicolier, Dominique De Werra

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) Deterministic scheduling theory in operations research (90B35) Extremal problems in graph theory (05C35)

Cites work

• scientific article; zbMATH DE number 3435543 (Why is no real title available?)
• scientific article; zbMATH DE number 3353065 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• scientific article; zbMATH DE number 3404264 (Why is no real title available?)
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• On A Particular Conference Scheduling Problem
• The Solution of a Timetabling Problem

Cited in

(6)

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

This page was built for publication: Compactness and balancing in scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145144)