RESEARCH ON JOBSHOP-LIKE MODELS
Abstract
Theoretical bases for solving problems relating to queues and congestion, production delays, and the timely completion of work are developed. The general question of how congestion and production delays depend upon a jobshop's facilities and workload and upon the decision rules which govern its functioning is studied. Tools are provided for dealing with a variety of optimization problems concerned with choosing the jobshop's facilities, influencing the generation of its workload, and designing its operating procedures. The current status of this research is outlined, mentioning some of the most closely related work done by others, and occasionally pointing to potential applications. The presentation is mainly devoted to two areas -- networks of queues, and queues with due-date-like priorities. The earlier studies on programming and combinatorial approaches to production scheduling and sequencing, the comparison of priority schemes by means of simulation, and the empirical characteristics of jobshops are not discussed. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 18, 1962
- Accession Number
- AD0283507
Entities
People
- Andrew A. Grindlay
- James R. Jackson
- Rosser T. Nelson
Organizations
- University of California, Los Angeles