Introduction to sequencing and scheduling, pp.108-110, 1974. ,
Computers and Intractability: A Guide to the Theory of NP Completeness, 1979. ,
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties, Mathematics of Operations Research, vol.13, issue.2, pp.330-348, 1988. ,
DOI : 10.1287/moor.13.2.330
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annal of Discrete Mathematics, vol.5, pp.287-326, 1979. ,
DOI : 10.1016/S0167-5060(08)70356-X
Heuristics for minimizing mean tardiness form parallel machines, Naval Research Logistics, vol.3, issue.3, pp.367-381, 1991. ,
DOI : 10.1002/1520-6750(199106)38:3<367::AID-NAV3220380307>3.0.CO;2-I
Chrétienne, An O n 3 algorithm for the one machine scheduling problem with ? Time windows to minimize the number of late jobs ,
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs, Discrete Applied Mathematics, vol.47, issue.2, pp.139-164, 1993. ,
DOI : 10.1016/0166-218X(93)90088-6
Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1979. ,
Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs, Management Science, vol.15, issue.1, pp.139-164, 1968. ,
DOI : 10.1287/mnsc.15.1.102
A Faster Strongly Polynomial Minimum Cost Flow Algorithm, Operations Research, vol.41, issue.2, pp.338-350, 1993. ,
DOI : 10.1287/opre.41.2.338