Reducibility among single machine weighted completion time scheduling problems

Reducibility among single machine weighted completion time scheduling problems

0.00 Avg rating0 Votes
Article ID: iaor19911575
Country: Switzerland
Volume: 26
Start Page Number: 91
End Page Number: 101
Publication Date: Dec 1990
Journal: Annals of Operations Research
Authors:
Abstract:

Various sum of weighted completion time problems are compared. The constraints considered include release date, deadline, and continuous machine processing. Relations between the problems are developed by examining the computational complexity of transforming one problem class into another. These results give indications of the relative computational effort required to solve different problem classes.

Reviews

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