Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Cites Work

Title not available (Why is that?)
On the recoverable robust traveling salesman problem
Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization
Discrete-time, economic lot scheduling problem on multiple, non-identical production lines
Using tabu search techniques for graph coloring
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing
Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Weighted sum coloring in batch scheduling of conflicting jobs
Graph multi-coloring for a job scheduling application
General variable neighborhood search for the order batching and sequencing problem
A tabu search algorithm for parallel machine total tardiness problem
Scheduling flexible flow lines with sequence-dependent setup times
Solving multi-objective production scheduling problems using metaheuristics
Scheduling with batching: A review
Cyclic lot-sizing problems with sequencing costs
A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
A cyclic approach to large-scale short-term planning in chemical batch production
Generating subtour elimination constraints for the TSP from pure integer solutions
A graph coloring heuristic using partial solutions and a reactive tabu scheme
A survey on vertex coloring problems
A concise guide to the Traveling Salesman Problem
Linear Reformulations of Integer Quadratic Programs
New methods to color the vertices of a graph
Reoptimizing the traveling salesman problem
Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
Solution of a Large-Scale Traveling-Salesman Problem
JuMP: A Modeling Language for Mathematical Optimization
Scheduling
Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem

This page was built for publication: Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context

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