Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

0.00 Avg rating0 Votes
Article ID: iaor20083058
Country: Netherlands
Volume: 35
Issue: 5
Start Page Number: 685
End Page Number: 692
Publication Date: Sep 2007
Journal: Operations Research Letters
Authors: ,
Abstract:

We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in just-in-time production systems.

Reviews

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