Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions

Journal of Applied Probability - Tập 17 Số 1 - Trang 187-202 - 1980
Gideon Weiss1, Michael Pinedo2
1Tel-Aviv University
2Instituto Venezolano de Investigaciones Cientificas.

Tóm tắt

We consider preemptive scheduling of N tasks on m processors; processors have different speeds, tasks require amounts of work which are exponentially distributed, with different parameters. The policies of assigning at every moment the task with shortest (longest) expected processing time among those not yet completed to the fastest processor available, second shortest (longest) to the second fastest etc., are examined, and shown to minimize expected values of various cost functions. As special cases we obtain policies which minimize expected flowtime, expected makespan and expected lifetime of a series system with m component locations and N spares.

Từ khóa


Tài liệu tham khảo

Ross, 1970, Applied Probability Models with Optimization Applications.

10.1214/aoms/1177699369

10.1002/nav.3800260314

Frederickson, 1978, Sequencing tasks with exponential service times to minimize the expected flow time or makespan

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

Van Der Heyden L. (1979) A note on scheduling jobs with exponential processing times on identical processors so as to minimize makespan. Math. Operat. Res.

Weber R. R. (1979) Scheduling stochastic jobs on parallel machines.

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

Journal of Applied Probability

Tập 17 Số 1

187-202

Thông tin tác giả