论文信息 - Ordered Flow Shop Problems with no In-Process Waiting: Further Results

Ordered Flow Shop Problems with no In-Process Waiting: Further Results

The ordered flow shop sequencing problem with no in-processing waiting (OFSNW) is considered with respect to mean flow time criterion. It is shown that the sequence in which jobs are arranged according to the shortest processing time rule (SPT) represents an optimal sequence. Additional results for the makespan criterion are also discussed.

S. S. Panwalkar | C. R. Woollam

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

[2] R. K. Arora,et al. Scheduling in a Semi-Ordered Flow-shop Without Intermediate Queues , 1980 .

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

[4] Richard A. Dudek,et al. Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

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

[6] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .

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

[8] S. S. Panwalkar,et al. Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case , 1979 .

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

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

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