Scheduling Rules for Parallel Processors.
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
This paper investigates various criteria under which simple scheduling rules generate optimum schedules for m machine scheduling problems. The problems are considered under a job-splitting assumption. Some of the rules which generate optimum schedules with job splitting for the multi-machine problems, do not split jobs for the single machine problems. The relationship between the job splitting and no job splitting problem in these cases, is analogous to the situation when an optimum solution to a linear program has all the variables integer and hence is optimum to the corresponding integer program. Author
- Computer Hardware