Optimal stochastic sequencing with earliness and/or tardiness costs

We consider a single- or multi-server facility where tasks belonging to N priority classes arrive for processing. Each task has a due date associated with its service completion. An earliness or tardiness penalty (depending on the task's priority) is incurred if the task is completed at a time other than its due date. We characterize properties of dynamic nonidling nonpreemptive as well as dynamic nonidling preemptive scheduling strategies that minimize an infinite horizon expected discounted cost due to the earliness and tardiness penalties, and provide examples that illustrate these properties.<<ETX>>

[1]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[2]  David Perry,et al.  CONTINUOUS PRODUCTION/INVENTORY MODEL WITH ANALOGY TO CERTAIN QUEUEING AND DAM MODELS , 1989 .

[3]  Keith W. Ross,et al.  Optimal priority assignment with hard constraint , 1986 .

[4]  Keith W. Ross,et al.  Optimal scheduling of interactive and noninteractive traffic in telecommunication systems , 1988 .

[5]  Wlodzimierz Szwarc.  Parametric precedence relations in single machine scheduling , 1990 .

[6]  Kishor S. Trivedi,et al.  A Single Server Queue in a Hard-Real-Time Environment , 1985 .

[7]  Esther Frostig,et al.  A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown–The Preemptive Repeat Model , 1991, Probability in the Engineering and Informational Sciences.

[8]  F. Baccelli,et al.  Single-server queues with impatient customers , 1984, Advances in Applied Probability.

[9]  H. Kaspi,et al.  Inventory systems of perishable commodities , 1983, Advances in Applied Probability.

[10]  Anthony Ephremides,et al.  Optimal scheduling with strict deadlines , 1989 .

[11]  Suresh P. Sethi,et al.  Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..

[12]  Anthony Ephremides,et al.  Stochastic monotonicity properties of multiserver queues with impatient customers , 1991, Journal of Applied Probability.

[13]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[14]  P. P. Bhattacharya,et al.  Optimal allocation of a server between two queues with due times , 1991 .

[15]  Adam Shwartz,et al.  Optimal priority assignment: a time sharing approach , 1989 .

[16]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

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

[18]  Don Towsley,et al.  Comparisons of service disciplines in a tandem queueing network with real time constraints , 1991, Oper. Res. Lett..

[19]  Demosthenis Teneketzis,et al.  Stochastic Scheduling in Priority Queues with Strict Deadlines , 1993 .

[20]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[21]  Weiss Gideon,et al.  Scheduling jobs with stochastic processing times and due dates to minimize total tardiness , 1992 .

[22]  Donald F. Towsley,et al.  Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service , 1988, JACM.

[23]  H. Kaspi,et al.  Inventory systems for perishable commodities with renewal input and Poisson output , 1984, Advances in Applied Probability.

[24]  S. Sethi,et al.  Equivalence of Mean Flow Time Problems and Mean Absolute Deviation Problems , 1990 .