Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
From MaRDI portal
(Redirected from Publication:6559404)
Recommendations
- Scheduling multi-colour print jobs with sequence-dependent setup times
- Integrated sequencing and scheduling in coil coating
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- Graph coloring problems
- Simultaneously scheduling multiple turns for steel color-coating production
Cites work
- A concise guide to the Traveling Salesman Problem
- A cyclic approach to large-scale short-term planning in chemical batch production
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing
- A survey on vertex coloring problems
- A tabu search algorithm for parallel machine total tardiness problem
- A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- Cyclic lot-sizing problems with sequencing costs
- Discrete-time, economic lot scheduling problem on multiple, non-identical production lines
- General variable neighborhood search for the order batching and sequencing problem
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Graph multi-coloring for a job scheduling application
- JuMP: a modeling language for mathematical optimization
- Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem
- Linear Reformulations of Integer Quadratic Programs
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization
- New methods to color the vertices of a graph
- On the recoverable robust traveling salesman problem
- Reoptimizing the traveling salesman problem
- Robust optimization
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Scheduling flexible flow lines with sequence-dependent setup times
- Scheduling with batching: A review
- Scheduling. Theory, algorithms, and systems
- Solution of a Large-Scale Traveling-Salesman Problem
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- Solving multi-objective production scheduling problems using metaheuristics
- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
- 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
- Using tabu search techniques for graph coloring
- Weighted sum coloring in batch scheduling of conflicting jobs
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)
