We consider a scheduling problem in which the criterion for assigning due dates is to make them as tight as possible, while the criterion for sequencing jobs is to minimize their tardiness. Because these two criteria conflict, we examine the trade-off between the tightness of the due dates and the tardiness of the jobs. We formulate a version of this trade-off in the case of a stochastic single...

We study the scheduling of multiple tasks under varying processing costs and derive a priority rule for optimal scheduling policies. Each task has a due date, and a non-completion penalty cost is incurred if the task is not completely processed before its due date. We assume that the task arrival process is stochastic and the processing rate is capacitated. Our work is motivated by both traditi...

Efficient values from Game Theory are used, in order to find out a fair allocation for a scheduling game associated with the problem of scheduling jobs with a common due date. A four person game illustrates the basic ideas and the computational difficulties.

0140-3664/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.comcom.2011.10.003 ⇑ Corresponding author. Tel.: +39 080 5963301; fax E-mail addresses: [email protected] (G. Piro), a.gr [email protected] (G. Boggia), [email protected] (P. 1 Note that HCF was initially introduced by 802.11e [2]. Now, this amendment has been integrated in the l The Hybrid Coordination Function is a very powerful ...

Consider the following due-date scheduling problem in a multiclass, acyclic, single-station service system: Any class k job arriving at time t must be served by its due date t+Dk. Equivalently, its delay k must not exceed a given delay or lead-time Dk. In a stochastic system, the constraint k Dk must be interpreted in a probabilistic sense. Regardless of the precise probabilistic formulation, h...

We analyze a number of due date assignment problems with the weighted number of tardy jobs objective and show that these problems can be solved in O(n) time by dynamic programming. We show that the effects of learning or the effects of past-sequence-dependent setup times can be incorporated into the problem formulation at no additional computational cost. We also show that some single-machine d...

We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomialtime algorithm to find the optimal job sequence, due date values and resource allocation minim...

In this paper, a new approach for due date assignment in a multi-stage job shop is proposed and evaluated. The proposed approach is based on a genetic programming technique which is known as gene expression programming (GEP). GEP is a relatively new member of the genetic programming family. The primary objective of this research is to compare the performance of the proposed due date assignment ...

This paper considers the problem of linding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solu...

Though many of the previous studies have been devoted to internal due date assignment in a wafer fabrication factory (wafer fab), very few among them considered the allowance added to a completion time forecast. In this way, the probability of on-time delivery is only about 50%. Methods based on confidence intervals generate completion time forecasts with very wide ranges and are not practical....