A scheduling problem on a general-purpose machine and many-group tasks with identical processors

A scheduling problem on a general-purpose machine and many-group tasks with identical processors

0.00 Avg rating0 Votes
Article ID: iaor20063352
Country: China
Volume: 11
Issue: 1
Start Page Number: 48
End Page Number: 51
Publication Date: Feb 2005
Journal: Journal of Shanghai University
Authors:
Abstract:

This paper discusses a Cmax problem for groups of jobs with a general-purpose machine and three special-purpose machines, all running at the same speed. An improved least processing time algorithm is derived and accurate bound performance obtained.

Reviews

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