Scheduling tasks with exponential service times on parallel processors

Journal of Applied Probability - Tập 16 Số 3 - Trang 685-689 - 1979
K. D. Glazebrook1
1University of Newcastle Upon Tyne

Tóm tắt

We consider the problem of how to schedule n tasks on to several identical processors to meet the objective of minimising the expected flow-time. The strategy which always serves those tasks whose processing-time distributions have the highest hazard rates is shown to be optimal when these distributions are all exponential.

Từ khóa


Tài liệu tham khảo

Weber R. R. and Nash P. (1978) An optimal strategy in multi-server stochastic scheduling. To appear.

10.1017/S0021900200045678

Glazebrook, 1976, On multi-server stochastic scheduling, J. R. Statist. Soc., 38, 67

Nash, 1973, Optimal Allocation of Resources Between Research Projects

Bruno, 1977, Sequencing tasks with exponential service times on two machines

Thông tin
Thông tin xuất bản

Journal of Applied Probability

Tập 16 Số 3

685-689

Thông tin tác giả