Computers and Operations Research
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding the chromatic number by means of critical graphs
Journal of Experimental Algorithmics (JEA)
Ant colony optimization theory: a survey
Theoretical Computer Science
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Project Management: A Systems Approach to Planning, Scheduling, and Controlling
Project Management: A Systems Approach to Planning, Scheduling, and Controlling
A graph coloring heuristic using partial solutions and a reactive tabu scheme
Computers and Operations Research
An adaptive memory algorithm for the k-coloring problem
Discrete Applied Mathematics
Graph colouring approaches for a satellite range scheduling problem
Journal of Scheduling
Variable space search for graph coloring
Discrete Applied Mathematics
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A Metaheuristic Approach for the Vertex Coloring Problem
INFORMS Journal on Computing
Hi-index | 0.00 |
Consider a project which consists of a set of jobs to be performed, assuming each job has a duration of at most one time period. We assume that the project manager provides a set of possible durations (in time periods) for the whole project. When a job is assigned to a specific time period, an assignment cost is encountered. In addition, for some pairs of jobs, an incompatibility cost is encountered if they are performed at the same time period. Both types of cost depend on the duration of the whole project, which also has to be determined. The goal is to assign a time period to each job while minimizing the costs. We propose a tabu search heuristic, as well as an adaptive memory algorithm, and compare them with other heuristics on large instances, and with an exact method on small instances. Variations of the problems are also discussed