Graph multi-coloring for a job scheduling application
From MaRDI portal
Publication:1686066
DOI10.1016/j.dam.2016.05.023zbMath1376.05061OpenAlexW2467648358MaRDI QIDQ1686066
Simon Thevenin, Jean-Yves Potvin, Nicolas Zufferey
Publication date: 20 December 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.023
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times ⋮ Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study ⋮ Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem ⋮ Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs ⋮ Exact algorithms for counting 3-colorings of graphs ⋮ Chromatic polynomial of intuitionistic fuzzy graphs using \(\left( \alpha, \beta\right)\)-levels
Cites Work
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times
- Parallel-machine scheduling with deteriorating jobs and rejection
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- Multi-objectives tabu search based algorithm for progressive resource allocation
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
- The one-machine just-in-time scheduling problem with preemption
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Weighted sum coloring in batch scheduling of conflicting jobs
- Scheduling multiprocessor tasks -- An overview
- On-line uniform machine scheduling with rejection
- Multi-neighborhood tabu search for the maximum weight clique problem
- Scheduling unrelated parallel machines with optional machines and jobs selection
- A hypocoloring model for batch scheduling
- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- A survey on vertex coloring problems
- New methods to color the vertices of a graph
- A learning tabu search for a truck allocation problem with linear and nonlinear cost components
- Mathematical Foundations of Computer Science 2004
- “Rent-or-Buy” Scheduling and Cost Coloring Problems
- Scheduling
- Handbook of metaheuristics
- Preemptive multiprocessor scheduling with rejection
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graph multi-coloring for a job scheduling application
