Sentence examples for tardiness problem from inspiring English sources

They present a new branch-and-bound algorithm for the famous total tardiness problem.

It has been applied to the dynamic single machine total weighted tardiness problem that has variational duedates, and satisfactory results have been achieved.

We formulated the joint problem, which is NP-hard since the total weighted tardiness problem (with fixed processing times) is strongly NP-hard alone, as a nonlinear mixed integer program.

This paper is concerned with solving the single machine total weighted tardiness problem with sequence dependent setup times by a discrete differential evolution algorithm developed by the authors recently.

Kellerer, V.A. Strusevich, A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date, Theoretical Computer Science 369 (2006) 230–238] by Kellerer and Strusevich.

One Japanese newspaper reports on a Tokyo school that had a chronic tardiness problem.

When he did not, and when Rider's career-long tardiness problems resurfaced -- along with his refusal to cooperate with the league over the administering of a drug test -- the Lakers merely moved on.

Experimental design results confirm the efficacy of the MBH over a wide range of single-machine earliness-tardiness problem instances.

In a recent paper by Valente "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time"', Computers & Industrial Engineering, 55, 663 675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earliness-tardiness problem on single machine with jobs independent weights and no machine idle time.

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.