论文信息 - Two-Machine Super-Shop Scheduling Problem

Two-Machine Super-Shop Scheduling Problem

The paper introduces the two-machine super-shop scheduling problem to minimize makespan. The well-known flow-shop, open-shop, job-shop and mixed-shop scheduling problems are special cases of our model. A polynomial-time algorithm to find both pre-emptive and non-pre-emptive optimal schedules is described.

V. A. Strusevich | V. Strusevich

[1] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[2] Teofilo F. Gonzalez,et al. Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[3] Hiroaki Ishii,et al. The mixed shop scheduling problem , 1985, Discret. Appl. Math..

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

[5] Teofilo F. Gonzalez,et al. Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

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