A new approach for scheduling independent tasks with multiple modes

Authors:
Massimiliano Caramia;Stefano Giordani
Affiliations:
Dipartimento di Ingegneria dell'Impresa, University of Rome "Tor Vergata", Rome, Italy 00133;Dipartimento di Ingegneria dell'Impresa, University of Rome "Tor Vergata", Rome, Italy 00133
Venue:
Journal of Heuristics
Year:
2009

Citing 4
Cited 2

Scheduling independent tasks with multiple modes

Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
Distance graphs and T-coloring

Journal of Combinatorial Theory Series B
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

A fast metaheuristic for scheduling independent tasks with multiple modes

Computers and Industrial Engineering
Scheduling technicians and tasks in a telecommunications company

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Heuristic algorithms for scheduling tasks with multiple modes and minimizing the schedule length involve in general two distinct phases, task mode assignment and then task scheduling. We propose a novel approach where these two features are managed in an integrated mechanism with mode assignment embedded in scheduling. The problem is first reformulated as a special single-mode task scheduling problem, and then is modeled as a graph interval T-coloring. Finally, a tabu-like metaheuristic is proposed for this latter graph coloring problem, and the performance of our approach is compared to known multi-mode scheduling heuristics.