论文信息 - Job shop flowtime prediction and tardiness control using queueing analysis

Job shop flowtime prediction and tardiness control using queueing analysis

Abstract This paper investigates flowtime prediction under conditions where Jackson's decomposition principle can be applied. Four models in which due-date setting rule parameters are based on predicted flowtime are developed and compared. Simulation results show both job characteristic and dynamic shop load information to be useful in predicting flowtimes. Analysis of prediction deviations shows that good predictions lead to errors which are approximately normally distributed. The variance of prediction errors can also be analytically determined. Therefore, quoted delivery dates can be set which are consistent with a desired level of delivery performance.

S. T. Enns

[1] T.C.E. Cheng. Optimal due-date assignment in a job shop† , 1986 .

[2] Kevin J. Dooley,et al. Dynamic rules for due-date assignment , 1991 .

[3] James K. Weeks. A Simulation Study of Predictable Due-Dates , 1979 .

[4] Kenneth R. Baker,et al. Improved decision rules in a combined system for minimizing job tardiness , 1984 .

[5] T.C.E. Cheng. Analysis of Job Flow-Time in a Job Shop , 1985 .

[6] J. Little. A Proof for the Queuing Formula: L = λW , 1961 .

[7] Shigeji Miyazaki,et al. Combined scheduling system for reducing job tardiness in a job shop , 1981 .

[8] D C LittleJohn. A Proof for the Queuing Formula , 1961 .

[9] Samuel Eilon,et al. Due dates in job shop scheduling , 1976 .

[10] Averill M. Law,et al. Simulation Modeling and Analysis , 1982 .

[11] Jwm Will Bertrand,et al. The use of workload information to control job lateness in controlled and uncontrolled release production systems , 1983 .

[12] William L. Maxwell,et al. Theory of scheduling , 1967 .

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

[14] G. Ragatz,et al. A simulation analysis of due date assignment rules , 1984 .