论文信息 - Optimal dispatching of two-priority job streams to two nonidentical machines

Optimal dispatching of two-priority job streams to two nonidentical machines

The following control problem in manufacturing is addressed. Jobs of two priority classes, C/sub 1/ and C/sub 2/, arrive at a system with two non-identical machines. Class C/sub 1/ jobs with higher priority have dispatch preference over C/sub 2/ jobs with lower priority. The problem is to dispatch appropriate fractions of class C/sub 1/ jobs to machines 1 and 2 so that the average flow time of C/sub 1/ jobs is minimized and neither C/sub 1/ jobs nor C/sub 2/ jobs are lost. The analytical solution to the problem is derived for various system disciplines, including: nonpreemptive priorities, preemptive priorities with resumption, preemptive priorities with resumption and setup and nonpreemptive priorities with multiple vacations.<<ETX>>

MengChu Zhou | P. B. Mirchandani

[1] J. Keilson. Queues Subject to Service Interruption , 1962 .

[2] Offer Kella,et al. Priorities in M/G/1 queue with server vacations , 1988 .

[3] William L. Maxwell,et al. Theory of scheduling , 1967 .

[4] D. Gaver. A Waiting Line with Interrupted Service, Including Priorities , 1962 .

[5] M. Neuts,et al. Introduction to Queueing Theory (2nd ed.). , 1983 .

[6] Michael J. Magazine,et al. A Classified Bibliography of Research on Optimal Design and Control of Queues , 1977, Oper. Res..

[7] Pitu B. Mirchandani,et al. Optimal dispatching of multipriority jobs to two heterogeneous workstations , 1989 .

[8] Satish K. Tripathi,et al. A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors , 1984, IEEE Transactions on Computers.

[9] D. P. Gaver,et al. A comparison of queue disciplines when service orientation times occur , 1963 .

[10] Wayne Winston. Optimal dynamic rules for assigning customers to servers in a heterogeneous queuing system , 1977 .