[1] Baker, K. R. and Scudder, G. D., “Sequencing with earliness and tardiness penalties: A Review,” Operations Research 38, 1990, 22-36.
[2] Bansal, S. P., “Single machine scheduling to minimize weighted sum of completion times with secondary criterion-a branch and bound approach,” European Journal of Operational Research, 1980, 5, 177-181.
[3] Biskup, D. and Feldmann, M., “Benchmarks for scheduling on a single-machine against restrictive and unrestrictive common due dates,” Computers and Operations Research, 2001, 28, 787–801.
[4] Burns, R. N., “Scheduling to minimize the weighted sum of completion times with secondary criteria,” Naval Research Logistics, 1976, 23, 125-129.
[5] Chand, S. and Schneeberger, H., “Single machine scheduling to minimize weighted earliness subject to no tardy jobs,” European Journal of Operational Research, 1988, 34, 221-230.
[6] Chen, W.-Y. and Sheen, G.-J., “Single machine scheduling with multiple performance measures: minimizing job dependent earliness and tardiness subject to the number of tardy jobs,” International Journal of Production Economics, 2007, 109, 214-229.
[7] Cheng, T. C. E. and Kahlbacher, H. G., “A proof for the longest/job/first policy in one/machine scheduling,” Naval Research Logistics, 1991, 38, 715-720.
[8] Cheng, T. C. E., Chen, Z.L., and Shakhlevich, N.V., “Common due date assignment and scheduling with ready times,” Computers & Operations Research, 2002, 29, 957-1967.
[9] Emmons, H., “A note on a scheduling problem with dual criteria,” Naval Research Logistics, 1975, 22, 615-616.
[10] Fattahi, P., “A Hybrid Multi Objective Algorithm for Flexible Job Shop Scheduling,” Engineering and Technology, 2009, 50, 551-556.
[11] Framinan, J. M. and Leisten, R., “A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness,” International Journal of Production Economics, 2006, 99, 28-40.
[12] Feldmann, M. and Biskup, D., “Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches,” Computers and Industrial Engineering, 2003, 44, 307-323.
[13] Hall, N., Kubiak W. and Sethi, S. , “Earliness-Tardiness Scheduling Problems, Ⅱ：Deviation of Completion Times About a Restrictive Common Due Date,” Operations Research, 1991, 39, 847-856.
[14] Heck, H. and Roberts, S., “A note on the extension of a result on scheduling with secondary criteria,” Naval Research Logistics, 1972, 19, 403-405.
[15] Hino, C. M., Ronconi, D. P. and Mendes, A. B., “Minimizing earliness and tardiness penalties in a single-machine problem with a common due date,” European Journal of Operational Research, 2005, 160, 190-201.
[16] Lawler, E. L., “Scheduling a single machine to minimize the number of late jobs,” EECS Department University of California, Berkeley, Technical Report No. UCB/CSD-83-139. 1983.
[17] Mazzini, R. and Armentano, V. A., “A heuristic for single machine scheduling with early and tardy costs,” European Journal of Operational Research, 2001, 128, 129-146.
[18] Miyazaki, S., “One machine scheduling problem with dual criteria,” Journal of Operational Research Society of Japan, 1981, 24, 37-50.
[19] Moore, J. M., “An n job, one machine sequencing algorithm for minimizing the number of late jobs,” Management Science, 1986, 15, 102-109.
[20] Nagar, A., Haddock, J. and Heragu, S., “Multiple and bicriteria scheduling：A literature survey,” European Journal of Operational Research, 1995, 81, 88-104.
[21] Nelson, R. T., Sarin, R. K., Daniels, R. L., “Scheduling with multiple performance measures：the one-machine case,” Management Science, 1986, 32, 464-479.
[22] Pathumnakul, S. and Egbelu P. J., “An algorithm for minimizing weighted earliness penalty in assembly job shops,” International Journal of Production Economics, 2006, 103, 230-245.
[23] Ronconi, D. P. and Kawamura, M. S., “The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm,” Computational & Applied Mathematics, 2010, 29, 107-124.
[24] Sen, T. and Gupta, S. K., “A branch-and bound procedure to solve a bicriterion scheduling problem,” IIE Transactions, 1983, 15, 84-88.
[25] Smith, W. E., “Various optimizers for single-stage production,” Naval Research Logistics, 1956, 3, 59-66.
[26] T’kindt, V. and Billaut, J.-C., “Some guideline to solve multicriteria scheduling problems,” IEEE, 1999, 463-468.
[27] Yeung, W. K., Oguz C. and Cheng, T. C. E., “Two-stage flowshop earliness and tardiness machine scheduling involving a common due window,” International Journal of Production Economics, 2004, 90, 421-434.
[28] Valente, J. M. S. and Alves, R. A. F. S., “Heuristics for the early/tardy scheduling problem with release dates,” International Journal of Production Economics, 2007, 106, 261-274.
[29] Valente, J.M.S. and Alves, R.A.F.S., “An exact approach to early/tardy scheduling with release dates,” Computers & Operations Research, 2005, 32, 2905-2917.