Approximation algorithms for fixed job schedule problems

Approximation algorithms for fixed job schedule problems

0.00 Avg rating0 Votes
Article ID: iaor19921724
Country: United States
Volume: 40
Start Page Number: 69
End Page Number: 77
Publication Date: Jan 1992
Journal: Operations Research
Authors: , ,
Keywords: programming: integer, heuristics
Abstract:

The authors 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 them in previous works, can arise in bus driver scheduling. The authors 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.

Reviews

Required fields are marked *. Your email address will not be published.