A comparative study of priority dispatching rules in a hybrid assembly/job shop
暂无分享,去创建一个
[1] William L. Maxwell,et al. Theory of scheduling , 1967 .
[2] Randall P. Sadowski,et al. A statistical comparison of the performance of simple dispatching rules for a particular set of job shops , 1976 .
[3] C. T. Baker,et al. Simulation of a Simplified Job Shop , 1960 .
[4] Donald C Carroll,et al. Heuristic sequencing of single and multiple component jobs. , 1965 .
[5] William L. Maxwell,et al. Multiple‐factor rules for sequencing with assembly constraints , 1968 .
[6] James E. Day,et al. Review of sequencing research , 1970 .
[7] Gerald Benjamin Siegel. An investigation of job shop scheduling for jobs with assembly constraints , 1971 .
[8] William L. Maxwell,et al. Network Dispatching by the Shortest-Operation Discipline , 1962 .
[9] Ashok R. Pai,et al. Simulation Research in Interchangeable Part Manufacturing , 1971 .
[10] B. W. Hollocks,et al. Book reviewModelling and analysis using Q-GERT networks: A. ALAN B. PRISKER, Wiley, New York, 470 pages, £ 13.15/$ 22.25 , 1978 .