Manufacturing resource planning Production planning Production scheduling
In many situations, certain "Job Shop" scenarios represent a complex queueing problem. A common constraint in many business and industry job shops is that certain jobs can only be processed on a specific machine, while the other jobs can be processed on more than one machine. Theoretically, it may be argued that a machine should be dedicated to each type or class of jobs. In the real world, many reasons may preclude this option. The job shop in this research is a real-world, finite-capacity system. The system is dynamic and stochastic in nature comprising of two independent machines with two classes of jobs arriving into a single queue. To provide a greater degree of control for schedulers, a new dispatching rule is developed in this study based on applying selectable weights to mean interarrival rates and mean processing times of job classes to establish decision rules for efficient dispatching of jobs to the two machines. A comprehensive simulation study is conducted to examine the effectiveness of the new rule. The results are compared to some selected, well-known job dispatching rules reported in the literature, in terms of various performance criteria. A full factorial, multivariate analysis of variance (MANOVA) is conducted to ascertain the significance of the main effects of the factors, as well as the significant interactions between factors, in terms of all the performance measures. Each significant factor is further investigated for differences in levels using Tukey's multiple comparison method, or HSD. The experimental results of this study show that the proposed dispatching rule, in conjunction with carefully chosen weighting parameters, tends to outperform all other dispatching rules (with respect to all the measures) in improving performance of the constrained job class under the different factor level combinations. The proposed rule, using different weighting parameters, also performed well under different factor level combinations for the non-constrained job class as well as for the overall system. The implications of the results yielded by the simulation experiments are discussed in detail. Finally, the managerial significance of the major findings are outlined and suggestions are made for further research in this area.
Metrics
22 File views/ downloads
11 Record Views
Details
Title
A simulation study of a dynamic multiple machine, multiple job class job shop with priority dispatching considerations
Creators
Ralph West Lowe
Contributors
Avijit Banerjee (Advisor) - Drexel University, Drexel University (1970-)
J. Burton (Advisor) - Drexel University, Drexel University (1970-)
Awarding Institution
Drexel University
Degree Awarded
Doctor of Philosophy (Ph.D.)
Publisher
Drexel University; Philadelphia, Pennsylvania
Resource Type
Dissertation
Language
English
Academic Unit
Bennett S. LeBow College of Business; Drexel University
Other Identifier
991021888958404721
Research Home Page
Browse by research and academic units
Learn about the ETD submission process at Drexel
Learn about the Libraries’ research data management services