On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes

In this paper we study scheduling problems of multiclass customers on identical parallel processors. A new type of arrival process, called a Markov decision arrival process, is introduced. This arrival process can be controlled and allows for an indirect dependence on the numbers of customers in the queues. As a special case we show the optimality of LEPT and the µc-rule in the last node of a controlled tandem network for various cost structures. A unifying proof using dynamic programming is given.

[1]  Thomas Kämpke,et al.  Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors , 1989, Oper. Res..

[2]  J. Baras,et al.  Two competing queues with linear costs: the μc-rule is often optimal , 1984, Advances in Applied Probability.

[3]  Richard Weber,et al.  Stochastic Scheduling on Parallel Processors and Minimization of Concave Functions of Completion Times , 1988 .

[4]  Ludo van der Heyden,et al.  Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan , 1981, Math. Oper. Res..

[5]  Thomas Kämpke.  On the optimality of static priority policies in stochastic scheduling on parallel machines , 1987 .

[6]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[7]  J. Shanthikumar,et al.  Extension of the bivariate characterization for stochastic orders , 1992, Advances in Applied Probability.

[8]  R. Weber.  SCHEDULING JOBS WITH STOCHASTIC PROCESSING REQUIREMENTS , 1982 .

[9]  Ger Koole.  Stochastic scheduling and dynamic programming , 1995 .

[10]  Gideon Weiss,et al.  Multiserver Stochastic Scheduling , 1982 .

[11]  Richard Weber.  Scheduling Stochastic Jobs on Parallel Machines to Minimize Makespan or Flowtime , 1982 .

[12]  Ger Koole,et al.  On the Assignment of Customers to Parallel Queues , 1992, Probability in the Engineering and Informational Sciences.

[13]  Cheng-Shang Chang,et al.  On the optimality of LEPT and cµ rules for machines in parallel , 1992, Journal of Applied Probability.

[14]  J. George Shanthikumar,et al.  Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures , 1989, Probability in the Engineering and Informational Sciences.

[15]  J. Walrand,et al.  The cμ rule revisited , 1985, Advances in Applied Probability.

[16]  Jan Karel Lenstra,et al.  Deterministic and stochastic scheduling: : Extended abstracts , 1981 .

[17]  Jean C. Walrand,et al.  An introduction to queueing networks , 1989, Prentice Hall International editions.

[18]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[19]  Armand M. Makowski,et al.  K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal☆ , 1985 .

[20]  Michael Pinedo,et al.  Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions , 1980, Journal of Applied Probability.

[21]  Ger Koole,et al.  The µc-rule is not optimal in the second node of the tandem queue: a counterexample , 1992, Advances in Applied Probability.

[22]  Greg N. Frederickson,et al.  Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan , 1981, JACM.

[23]  Michael Pinedo,et al.  Scheduling of stochastic tasks on two parallel processors , 1979 .

[24]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[25]  David D. Yao,et al.  Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..

[26]  S. Asmussen,et al.  Marked point processes as limits of Markovian arrival streams , 1993 .