scientific article; zbMATH DE number 151873

MaRDI QIDQ4031981zbMATHFDO

Authors Philippe Vincke

Publication date 3 May 1993

zbMATH Keywords

simulated annealinggraph coloringresource constraintscoloring algorithmchromatic methodindependent integer-length tasks

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On a multiconstrained model for chromatic scheduling
• Extensions of coloring models for scheduling purposes
• Chromatic scheduling
• A graph coloring algorithm for large scale scheduling problems
• Graph coloring problems

Cited in

(1)

• Chromatic scheduling

This page was built for publication:

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