The problems are strongly NP-hard as they contain the strongly NP-hard classical single-machine total weighted tardiness scheduling problem (Lenstra et al. [4]) as a special case when the delivery part is not considered.
European Journal of Operational Research 2007; doi 10.1016/j.ejor.2007.10.044] and Anghinolfi and Paolucci [A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem. http://www.discovery.dist.unige.it/papers/Anghinolfi_Paolucci_ACO.pdf, respectively.
Gutjahr et al. [9] developed a stochastic branch-and-bound method for optimal single-machine tardiness scheduling.
They are novel contributions of this paper to the single machine tardiness related scheduling problems with sequence dependent setup times.
In this work three genetic algorithms are presented for the permutation flowshop scheduling problem with total tardiness minimisation criterion.
Given a single machine and a set of jobs with due dates, the classical NP-hard problem of scheduling to minimize total tardiness is a well-understood one.
Figure 10 shows a comparison of the percentage of blocked requests (requests that could not be scheduled) where the allowed tardiness parameter value is very small (1 time unit).
Two scenarios related to "Day of Surgery Decisions" based on medical direction of nurse anesthetists by anesthesiologists to reduce over-utilized OR time or, when over-utilized OR time did not occur, to reduce expected tardiness from scheduled start times [ 11].
Their objective was to minimise both the mean tardiness of the schedule and the deviations between initial and final schedules.
A moving block heuristic (MBH) is developed for earliness-tardiness scheduling problems, which are observed in just-in-time (JIT) production environments.
