Journal of Japan Industrial Management Association
Online ISSN : 2432-9983
Print ISSN : 0386-4812
Applications of Probabilistic Dispatching Method to the Dynamic Scheduling Problem : Studies on Probabilistic Dispatching Method in Job-Shop Scheduling (Part III)
Shigeji MIYAZAKIFumio HASHIMOTO
Author information
JOURNAL FREE ACCESS

1977 Volume 28 Issue 1 Pages 84-90

Details
Abstract
A probabilistic dispatching method has been presented as an approximate solution of Static Scheduling Problem[4] . It is impossible to apply this method to the conventional model of Dynamic Scheduling Problem, for the arrival time of job is given as a random variable. The arrival time of each job, however, is often given individually before the scheduling is performed according to the production planning. In this paper, the probabilistic dispatching method is applied to a new Dynamic Scheduling Problem, consequently the effects and the problems in the application are shown.
Content from these authors
© 1977 Japan Industrial Management Association
Previous article Next article
feedback
Top