John M. Hoffman
ABSTRACT
The purpose of this paper was to introduce some of the preliminary findings resulting from the studies into the management of a class of computer based information systems which were conducted in the School of Information and Computer Science of the Georgia Institute of Technology. One of the main accomplishments was the specification of a pre-scheduling system which could monitor existing and future workloads and could identify effective processing sequences. The pre-scheduling procedure and its basic components were outlined through the identification of the fundamental defining expressions. The possible effects of the implementation of such a procedure were investigated through several experiments and a summary of these have been presented as to the effects of the pre-scheduling upon management decisions.
- 1.Hellerman, H. and H. J. Smith, Jr., "Throughput Analysis of Some Idealized Input, Output, and Computer Overlap Configurations," Computing Surveys, 2, 111-118, 1970. Google Scholar
Digital Library
- 2.Lawler, E. L., "On Scheduling Problems with Deferral Costs," Management Science, 11, 280-288, 1964.Google ScholarDigital Library
- 3.Hoffman, J. M., "A Pre-Scheduler and Management Model for a Class of Computer-User Systems," (Ph.D. Thesis) Georgia Institute of Technology, March 1971. Google ScholarDigital Library
Index Terms
- Pre-scheduling—a management tool?
Recommendations
Single Machine Batch Scheduling Problem with Resource Dependent Setup and Processing Time in the Presence of Fuzzy Due Date
We consider a batch scheduling problem on a single machine which processes jobs with resource dependent setup and processing time in the presence of fuzzy due-dates given as follows:
1. There are n independent non-preemptive and simultaneously ...
Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity
We consider single-machine scheduling with a common due-window and a deteriorating rate-modifying activity. We assume that the processing time of a job is a function of the amount of a resource allocated to it, its position in the processing sequence, ...
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
We consider a single-machine scheduling problem in which job processing times are controllable through the allocation of a limited resource. The amount of resource consumption of a job is assumed to be linearly related to the job processing time. The ...
Comments