A graph coloring approach to the deployment scheduling and unit assignment problem

DOI10.1007/s10951-015-0434-0zbMath1341.90060OpenAlexW576858340MaRDI QIDQ283268

Mark Zais, Manuel Laguna

Publication date: 13 May 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-015-0434-0

zbMATH Keywords

optimizationschedulingmetaheuristicsgraph coloringinterval graph

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Grouping products for the optimization of production processes: a case in the steel manufacturing industry

Cites Work

• Unnamed Item
• Survey of multi-objective optimization methods for engineering
• Modeling staff scheduling problems. A tutorial
• A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
• A note on the problem of reporting maximal cliques
• A review of strategic mobility models supporting the defense transportation system
• The deployment scheduling analysis tool (DSAT)
• Survey, categorization, and comparison of recent tour scheduling literature
• Coloring interval graphs with First-Fit
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
• Personnel scheduling: a literature review
• A survey of local search methods for graph coloring
• A survey on vertex coloring problems
• The Linearity of First-Fit Coloring of Interval Graphs
• A graph coloring algorithm for large scheduling problems
• Tabu Search—Part I
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• On the recursive largest first algorithm for graph colouring

This page was built for publication: A graph coloring approach to the deployment scheduling and unit assignment problem