Tardiness (scheduling)

In scheduling, tardiness is a measure of a delay in executing certain operations and earliness is a measure of finishing operations before due time. The operations may depend on each other and on the availability of equipment to perform them.

Typical examples include job scheduling in manufacturing and data delivery scheduling in data processing networks.[1]

In manufacturing environment, inventory management considers both tardiness and earliness undesirable. Tardiness involves backlog issues such as customer compensation for delays and loss of goodwill. Earliness incurs expenses for storage of the manufactured items.[2]

Mathematical formulations

In an environment with multiple jobs, let the deadline be ${\displaystyle d_{i}}$ and the completion time be ${\displaystyle C_{i}}$ of job ${\displaystyle i}$. Then for job ${\displaystyle i}$

• lateness is ${\displaystyle L_{i}=C_{i}-d_{i}}$,
• earliness is ${\displaystyle E_{i}=\max(0,d_{i}-C_{i})}$,
• tardiness is ${\displaystyle T_{i}=\max(0,C_{i}-d_{i})}$.

In scheduling common objective functions are ${\displaystyle C_{\max },L_{\max },E_{\max },T_{\max },\sum C_{i},\sum L_{i},\sum E_{i},\sum T_{i}}$ or weighted version of these sums, ${\displaystyle w_{i}C_{\max },w_{i}L_{\max },w_{i}E_{\max },w_{i}T_{\max },\sum w_{i}C_{i},\sum w_{i}L_{i},\sum w_{i}E_{i},\sum w_{i}T_{i}}$, where every job comes with a weight ${\displaystyle w_{i}}$. The weight is a representation of job cost, priority, etc.

In a large number of cases the problems of optimizing these functions are NP-hard.[3]

References

1. Minimizing tardiness in data aggregation scheduling with due date consideration for single-hop wireless sensor networks, Wireless Networks, Volume 21 Issue 4, May 2015 Pages 1259-1273
2. Derya Eren Akyol, G. Mirac Bayhan, Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach, The International Journal of Advanced Manufacturing Technology May 2008, Volume 37, Issue 5, pp 576-588.
3. "Complexity results for scheduling problems", University of Osnabrueck