Showing papers on "Job shop published in 1969"
TL;DR: The study indicates that, for a fully loaded shop, giving priority to be the job with the shortest actual setup time, regardless of its run time, gives the best overall performance result.
Abstract: A job shop was simulated in order to determine the effect of different job priority rules involving setup times on shop performance. The seven priority rules tested were chosen on the basis that they could be implemented by job shop foremen. Assumptions in the simulation model were based on experience with an electronics company and published literature. The study indicates that, for a fully loaded shop, giving priority to be the job with the shortest actual setup time, regardless of its run time, gives the best overall performance result.
99 citations
TL;DR: The authors have devised a specific apportionment of the problem environment which permits users of their information system to explore the effects of various combinations of heuristics and programmed decision rules in multi-dimensional, time-variant problem solving.
Abstract: The use of on-line, real-time computer-based information systems to augment managerial decision making raises interesting and significant questions. In search of operational answers, the authors have developed and conducted experiments with a time-sharing computer model. By modeling the dynamics of a job shop the authors were able both to make use of and to evaluate academic research in job shop scheduling. The authors have devised a specific apportionment of the problem environment which permits users of their information system to explore the effects of various combinations of heuristics and programmed decision rules. The response of over 300 managers and academicians who have participated in the experiments provides evidence of the practicality of such an approach to multi-dimensional, time-variant problem solving.
93 citations
TL;DR: This work considers the problem of maximizing the long-run average return in a single server traffic reward system in which the customer’s offer, a joint distribution of reward and of service time required to earn this reward, is independent of the renewal process which governs customer arrivals.
Abstract: We consider the problem of maximizing the long-run average return in a single server traffic reward system in which the customer’s offer, a joint distribution of reward and of service time required to earn this reward, is independent of the renewal process which governs customer arrivals. After formulating the problem as a semi-Markov decision process, we characterize the form of an optimal policy. When the renewal process is Poisson, the characterization is easily stated : accept a customer if and only if the ratio of his expected reward to his expected service time is larger than g, the long-run average return. When the arrival process is Poisson, g is easily found. Next, batch arrivals are permitted, and further results are obtained.
69 citations
DOI•
08 Dec 1969TL;DR: A job shop simulator designed for use in the scheduling of a set of jobs and used in conjunction with a search program that adjusts priority rule parameters in seeking an improved schedule.
Abstract: The paper discusses a job shop simulator designed for use in the scheduling of a set of jobs. The simulator has been implemented in the form of a Fortran program. The simulator can be used in conjunction with a search program that adjusts priority rule parameters in seeking an improved schedule.
16 citations
TL;DR: In this paper, the authors view the job shop as a network of queues with each work center then defined as a single or multichannel service facility and the effect of learning at the service facility will be seen as a reduction of queue congestion and a lessening of unit waiting time.
Abstract: The job shop may be viewed as a network of queues with each work center then defined as a single or multichannel service facility. In the low volume situation, manufacturing improvements may be expected of each work station. The effect of learning at the service facility will be seen as a reduction of queue congestion and a lessening of unit waiting time. This may eventually lead to excessive idle service capacity or reduced machine utilization. Where there are several machines at each work station, and learning can be expected, a scheme can be developed wherein machines could be released on a schedule to other work assignments while maintaining a relatively constant level of machine utilization.
2 citations
DOI•
08 Dec 1969TL;DR: In this article, the authors simulate the activities of planning and manufacturing batches of components in a job shop and use simulation of present clerical rules as a basis for a more powerful shoploading system.
Abstract: This model simulates the activities of planning and manufacturing batches of components in a job shop. Simulation of the planning stage forms the basis of a tool to completely reschedule the shop from its actual position, having regard to due dates and machine resources. The execution of this plan is simulated giving management data on the effects of present decisions. A significant feature of the model is the use of simulation of present clerical rules as a basis for a more powerful shoploading system.
2 citations
DOI•
08 Dec 1969TL;DR: The state of the art of job shop research is investigated via the development of a framework within which problems and results may be described and the research which arises from it is investigated.
Abstract: The state of the art of job shop research is investigated via the development of a framework within which problems and results may be described The bulk of the paper is devoted to the development of the framework and the research which arises from it Few explicit references are made to the large body of published research on the problem
2 citations