Solution methods for a scheduling problem with incompatibility and precedence constraints

MaRDI QIDQ2865858zbMATH OpenFDO

Authors François-Xavier Meuwly, Bernard Ries, Nicolas Zufferey

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/14273

zbMATH Keywords

local searchmixed graph coloringproject scheduling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Multi-coloring and job-scheduling with assignment and incompatibility costs
• scientific article; zbMATH DE number 512917
• Time slot scheduling of compatible jobs
• Scheduling with incompatible jobs
• scientific article; zbMATH DE number 1594564

Cited in

(4)

• Graph multi-coloring for a job scheduling application
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
• Heuristics for a project management problem with incompatibility and assignment costs
• Graph coloring models and metaheuristics for packing applications

Describes a project that uses

Uses Software

• Tabu search
• CPLEX

This page was built for publication: Solution methods for a scheduling problem with incompatibility and precedence constraints

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