Graph multi-coloring for a job scheduling application
type: Item
instance of: scholarly article
title: Graph multi-coloring for a job scheduling application
zbMATH Open document ID: 1376.05061
author: Simon Thevenin
author: Nicolas Zufferey
author: Jean-Yves Potvin
published in: Discrete Applied Mathematics
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6820617
zbMATH Keywords: metaheuristics
zbMATH Keywords: job scheduling
zbMATH Keywords: graph coloring
MaRDI profile type: Publication
full work available at URL: j.dam.2016.05.023
OpenAlex ID: W2467648358
cites work: Q4875173
cites work: Multi-objectives tabu search based algorithm for progressive resource allocation
cites work: Multi-coloring and job-scheduling with assignment and incompatibility costs
cites work: New methods to color the vertices of a graph
cites work: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
cites work: Q4238573
cites work: A hypocoloring model for batch scheduling
cites work: Q4495173
cites work: Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
cites work: Scheduling multiprocessor tasks -- An overview
cites work: Parallel machine scheduling with additional resources: notation, classification, models and solution methods
cites work: Weighted sum coloring in batch scheduling of conflicting jobs
cites work: Scheduling unrelated parallel machines with optional machines and jobs selection
cites work: “Rent-or-Buy” Scheduling and Cost Coloring Problems
cites work: Handbook of metaheuristics
cites work: Scheduling on parallel identical machines with job-rejection and position-dependent processing times
cites work: A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
cites work: Mathematical Foundations of Computer Science 2004
cites work: On-line uniform machine scheduling with rejection
cites work: The one-machine just-in-time scheduling problem with preemption
cites work: Q2753942
cites work: Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach
cites work: Parallel-machine scheduling with deteriorating jobs and rejection
cites work: Bounded single-machine parallel-batch scheduling with release dates and rejection
cites work: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
cites work: A survey on vertex coloring problems
cites work: Solution methods for a scheduling problem with incompatibility and precedence constraints
cites work: Scheduling
cites work: A learning tabu search for a truck allocation problem with linear and nonlinear cost components
cites work: Q4252357
cites work: Preemptive multiprocessor scheduling with rejection
cites work: Q4411417
cites work: Metaheuristics for a scheduling problem with rejection and tardiness penalties
cites work: Multi-neighborhood tabu search for the maximum weight clique problem
DOI: 10.1016/J.DAM.2016.05.023
description: scientific article; zbMATH DE number 6820617