Dynamic Network Construction for Job-Shop Scheduling Systems

摘要

Although some researchers have proposed the dynamic model for the job-shop scheduling system, the inclusion of uncertainties and evidence into the model is still uncommon. In this paper, we proposed a novel approach in solving the jobshop scheduling system based on decision theory. The objective of this research is to develop a job-shop scheduling system that is reactive, usable, effective, and robust. In this paper, proactive and reactive approaches, the two approaches in solving the dynamic job-shop problems, are combined into one integrated model. Formal definition and solution algorithm for the dynamic job-shop problem are presented. Our approach can accommodate the uncertainties and evidence of the shop-floor. Reducing into deterministic one, the algorithm has been successfully applied to some job-shop problems with minimizing makespan as the objective function.