论文信息 - Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case - 字舞流文

Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case

The objective is to minimize makespan for a special case of flow shop problems subject to the constraint that no in-process waiting is allowed. Several new results are proposed.

S. S. Panwalkar | C. R. Woollam

[1] Wlodzimierz Szwarc. Permutation flow‐shop theory revisited , 1978 .

[2] D. A. Wismer,et al. Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[3] R. A. Dudek,et al. Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .

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

[5] S. S. Panwalkar,et al. Flowshop sequencing problem with ordered processing time matrices: A general case , 1976 .

[6] James E. Day,et al. Review of sequencing research , 1970 .

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

[8] S. S. Panwalkar,et al. A convex property of an ordered flow shop sequencing problem , 1977 .

[9] S. S. Panwalkar,et al. An ordered flow-shop sequencing problem with mean completion time criterion† , 1976 .

[10] S. K. Goyal. A Note on the Paper: On the Flow-Shop Sequencing Problem with No Wait in Process , 1973 .

[11] J. Gupta. Optimal flowshop schedules with no intermediate storage space , 1976 .

[12] Salah E. Elmaghraby,et al. The machine sequencing problem – review and extensions , 1968 .