Parallel machine scheduling with an aid of network flow model

Parallel machine scheduling with an aid of network flow model

0.00 Avg rating0 Votes
Article ID: iaor1991179
Country: South Korea
Volume: 15
Issue: 2
Start Page Number: 11
End Page Number: 22
Publication Date: Dec 1989
Journal: Journal of the Korean Institute of Industrial Engineers
Authors: , ,
Keywords: networks
Abstract:

The problem of scheduling n-jobs on m-uniform parallel machines is considered, in which each job has a release time, a deadline, and a processing requirement. The job processing requirements are allocated to the machines so that the maximum of the load differences between time periods is minimized. Based on Federgruen’s maximum flow network model to find a feasible schedule, a polynomially bounded algorithm is developed. An example to show the effectiveness of the present algorithm is presented. [In Korean.]

Reviews

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