论文信息 - Preemptive scheduling of independent jobs on parallel machines subject to financial constraints - 字舞流文

Preemptive scheduling of independent jobs on parallel machines subject to financial constraints

[1] F. Brian Talbot,et al. Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .

[2] Alexander H. G. Rinnooy Kan,et al. Scheduling subject to nonrenewable-resource constraints , 1982, Oper. Res. Lett..

[3] R. Słowiński. Multiobjective network scheduling with efficient use of renewable and nonrenewable resources , 1981 .

[4] Roman Słowiński,et al. Two Approaches to Problems of Resource Allocation Among Project Activities — A Comparative Study , 1980 .

[5] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .

[6] Roman Slowinski,et al. Cost-Minimal Preemptive Scheduling of Independent Jobs With Release and Due Dates on Open Shop Under Resource Constraints , 1979, Inf. Process. Lett..

[7] Roman Slowinski,et al. Scheduling preemptible tasks on unrelated processors with additional resources to minimize schedule length , 1978, ECI.

[8] Salah E. Elmaghraby,et al. Activity networks: Project planning and control by network models , 1977 .