A dynamic job shop scheduling framework: a backward approach
暂无分享,去创建一个
[1] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.
[2] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[3] Wolter J. Fabrycky,et al. An Input/Output Control System For The Dynamic Job Shop , 1987 .
[4] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[5] Reha Uzsoy,et al. Analysis of periodic and event-driven rescheduling policies in dynamic shops , 1992 .
[6] K. R. Baker,et al. An investigation of due-date assignment rules with constrained tightness , 1981 .
[7] Abraham Seidmann,et al. Due Date Assignment for Production Systems , 1981 .
[8] Don T. Phillips,et al. A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .
[9] B. Kingsman,et al. Production planning systems and their applicability to make-to-order companies , 1989 .
[10] William L. Maxwell,et al. Theory of scheduling , 1967 .
[11] Charles A. Holloway,et al. Alternative Formulation of the Job Shop Problem with Due Dates , 1973 .
[12] Ludo Gelders,et al. Production planning: a review , 1981 .
[13] J. Lenstra,et al. Job-Shop Scheduling by Implicit Enumeration , 1977 .
[14] Egon Balas,et al. Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..
[15] T.C.E. Cheng. Optimal due-date assignment in a job shop† , 1986 .
[16] Gary L. Ragatz,et al. A framework for the study of due date management in job shops , 1984 .
[17] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .