Graph multi-coloring for a job scheduling application
- 1 January 2018
- journal article
- conference paper
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 234, 218-235
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- The solution algorithms for the multiprocessor scheduling with workspan criterionExpert Systems with Applications, 2013
- Scheduling unrelated parallel machines with optional machines and jobs selectionComputers & Operations Research, 2012
- Multi-neighborhood tabu search for the maximum weight clique problemAnnals of Operations Research, 2012
- A survey on vertex coloring problemsInternational Transactions in Operational Research, 2009
- Embedded simulation on a multiprocessor job scheduling system with inspectionComputers & Industrial Engineering, 2009
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivalsTheoretical Computer Science, 2009
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespanTheoretical Computer Science, 2008
- Stochastic Local Search Algorithms for Graph Set T-colouring and Frequency AssignmentConstraints, 2007
- Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform MachinesComputing, 2005
- New methods to color the vertices of a graphCommunications of the ACM, 1979