Construction of efficient point set of 1//Tmax scheduling corresponding to controllable due dates

Construction of efficient point set of 1//Tmax scheduling corresponding to controllable due dates

0.00 Avg rating0 Votes
Article ID: iaor20041576
Country: China
Volume: 8
Issue: 3
Start Page Number: 243
End Page Number: 246
Publication Date: Jan 2002
Journal: Journal of Shanghai University
Authors: , ,
Abstract:

This paper considers the sequencing problem of 1//Tmax with controllable due dates. Let F1 and F2 represent Tmax and the sum of the weighted due date delays. For the problem of minimizing F1 and F2 simultaneously, this paper develops a pseudopolynomial algorithm for the construction of the efficient point set.

Reviews

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