论文信息 - Simulation studies of multilevel dynamic job shop scheduling using heuristic dispatching rules

Simulation studies of multilevel dynamic job shop scheduling using heuristic dispatching rules

Abstract We present a two-level scheduling technique in which heuristic rules are used to determine the job-to-machine routing and the job sequencing. The effectiveness of this strategy on jobs that arrive continuously with prescribed due dates is studied using 88 sets of simulations. We also present the sensitivity of the heuristic rules to variations in job due dates.

[1] Henry C. Co,et al. Sequencing in flexible manufacturing systems and other short queue-length systems , 1988 .

[2] Kenneth R. Baker,et al. Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[3] J. H. Mulligan,et al. Performance forecasts as feedback for schedule generation , 1992 .

[4] Ari P. J. Vepsalainen. Priority rules for job shops with weighted tardiness costs , 1987 .

[5] Elsayed A. Elsayed,et al. Job shop scheduling with alternative machines , 1990 .

[6] Yeou-Fang Wang. Artificial neural networks and their applications to manufacturing scheduling problems , 1991 .

[7] S. S. Panwalkar,et al. A Survey of Scheduling Rules , 1977, Oper. Res..

[8] Jr. J. Cruz,et al. Leader-follower strategies for multilevel systems , 1978 .

[9] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[10] Khalil S. Hindi,et al. A multilevel multilayer framework for manufacturing control , 1991, J. Intell. Robotic Syst..

[11] Alessandro Agnetis,et al. Part routing in flexible assembly systems , 1990, IEEE Trans. Robotics Autom..

[12] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .