论文信息 - A two-machine flowshop sequencing problem with limited waiting time constraints - 字舞流文

A two-machine flowshop sequencing problem with limited waiting time constraints

D. Yang | Maw-Sheng Chern | Dar-Li Yang

[1] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .

[2] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[3] G. B. McMahon,et al. Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..

[4] C. V. Ramamoorthy,et al. On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

[5] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] D. Pohoryles,et al. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[8] D.H.R. Price,et al. A Microcomputer Based Solution to a Practical Scheduling Problem , 1985 .