Research Reports from the Department of Operations
Document Type
Report
Publication Date
6-1-1986
Abstract
Given a start time sj, duration pj, and the minimal processor capacity required rj, for each of n jobs (j=1,...,n), we wish to find the optimal mix of processors, available in two different sizes, required to complete all jobs on schedule. A job with a smaller size requirement can be done by a bigger processor, but not vice versa. We present algorithms for solving this problem under two different objectives: (a) Minimize the total number of processors, and, given that, minimize the number of bigger processors: (b) Minimize the total costs of the processors.
Keywords
Operations research, Industrial management, Production scheduling, Materials management, Mathematical optimization, Algorithms, Resource allocation
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 577
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Dondeti, Venkateswara Reddy and Emmons, Hamilton, "Resource Requirements for Scheduling with Different Processor Sizes - Part I" (1986). Research Reports from the Department of Operations. 483.
https://commons.case.edu/wsom-ops-reports/483