论文信息 - On the two-phase method for preemptive scheduling

On the two-phase method for preemptive scheduling

Abstract Preemptive scheduling problems on parallel processors may in some cases be solved by a two-phase method: forst solve a LP problem which will give the minimum total completion time T and the processing times of the jobs on the various processors; second construct a feasible schedule using T time units. Some extensions of this procedure are discussed. A general model for preemptive scheduling is described with a two-phase method for solving problems of this type.

D. de Werra

[1] D. de Werra,et al. Variations on the integral decomposition property , 1986 .

[2] Jacek Blazewicz,et al. Scheduling under resource constraints - deterministic models , 1986 .

[3] Dominique de Werra,et al. Preemptive scheduling with staircase and piecewise linear resource availability , 1989, ZOR Methods Model. Oper. Res..

[4] Roman Słowiński. Production scheduling on parallel machines subject to staircase demands , 1988 .

[5] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[6] D. de Werra,et al. Preemptive Scheduling, Linear Programming and Network Flows , 1984 .

[7] Dominique de Werra. A decomposition property of polyhedra , 1984, Math. Program..