论文信息 - Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time

Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time

This paper deals with the problem of finding the minimum finish-time schedule in a two-machine flowshop, where the processing times of jobs are linearly dependent on the job waiting-times. The problem is shown to be NP-hard. A heuristic algorithm is presented, and the worst-case bounds are derived for the different variations of the algorithm.

Chelliah Sriskandarajah | Suresh Kumar Goyal

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

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

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

[4] Chelliah Sriskandarajah,et al. Some no-wait shops scheduling problems: Complexity aspect , 1986 .

[5] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[6] C. V. Ramamoorthy,et al. Reply to Dr. Goyal's Comments , 1973 .

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

[8] Jan Karel Lenstra,et al. Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

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

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

[11] C. V. Ramamoorthy,et al. A Scheduling Problem , 1973 .