Approximation Algorithms for Fixed Job Schedule Problems

Publisher Website
Google Scholar
Abstract
We consider two generalizations of the fixed job schedule problem, obtained by imposing a bound on the spread-time or on the working time of each processor. These NP-hard problems, studied by the authors in previous works, can arise in bus driver scheduling. We introduce several polynomial-time approximation algorithms, give efficient implementations for them, and analyze their complexity and worst case performance. The average behavior is also investigated through extensive computational experiments.

This publication has 0 references indexed in Scilit: