Bean, J.C., (1994). "Genetics and random keys for sequencing and optimization". ORSA Journal on Computing;6:154–60.
Bülbül, K., Kaminsky, P., Yano, C., (2007). "Preemption in single machine earliness/ tardiness scheduling". Journal of Scheduling, 10, 271–292.
Cochran, W.G., Cox, G.M., (1992). "Experimental designs:. 2nd ed. New York: Wiley.
Davis, J.S., Kanet, J.J., (1993)." Single-machine scheduling with early and tardy completion costs". Naval Research Logistics, 40, 85–101
Goldberg, D.E., (1989)." Genetic algorithms in search, optimization, and machine learning. Reading", MA: Addison-Wesley
Hendel, Y., Sourd, F., (2006)." Efficient neighborhood search for the one-machine earliness–tardiness scheduling problem". European Journal of Operational Research, 173, 108–119.
Hendel, F., Runge, N., Sourd, F., (2009)." The one-machine just-in-time scheduling problem with preemption". Discrete Optimization, 6, 10-22.
Holland, J.H., "Adaptation in natural and artificial systems. Ann Arbor", Michigan: University of Michigan Press.
Jَzefowska, J., 2007. Just-in-time scheduling. Berlin: Springer
Khorshidian, H., Javadian, N., Zandieh, M., Rezaeian, J., Rahmani, K., 2011. " A genetic algorithm for JIT single machine scheduling with preemption and machine idle time". Expert Systems with Applications 38, 7911-7918.
Lenstra, J.K., Rinnooy Kan, A.H., Brucker, G.P., 1977. "Complexity of machine scheduling problems". Annals of Discrete Mathematics, 1, 343–362.
Liao, C.J., Cheng, C.C., 2007. "A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date". Computers and Industrial Engineering, 52, 404–413.
Michalewicz, Z., 1996. Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York.
Montgomery, D.C., 2000. "Design and analysis of experiments". 5th ed. New York:
Reeves, C.R., 1997. "Genetic algorithms for the operations researcher". INFORMS Journal on Computing; 9:231–50.
Reeves, C., Glover F, Kochenberger., 2003. "Handbook of metaheuristics." Dordrecht: Kluwer Academic Publishers; p. 55–82.
Sourd, F., Kedad-Sidhoum, S., 2003."The one machine problem with earliness and tardiness penalties". Journal of Scheduling; 6:533–49.
Sun, X., Noble, J.S., Klein C.M., 1999. "Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness". IIE Transactions; 31:113–24.
Taguchi, G., 1986. "Introduction to quality engineering. White Plains": Asian Productivity Organization/UNIPUB
Valente, J.M.S., 2006. Heuristics for the single machine scheduling problem with early and quadratic tardy penalties.
Valente, J.M.S., 2007. "Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs. Working Paper 250, Faculdade de Economia, Universidade do Porto, Portugal";. Asia-Pacific Journal of Operational Research, to appear.
Valente, J.M.S., Alves, R.A.F.S., 2008. "Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties". Computers & Operations Research. 35, 3696-3713.
Valente, J.M.S., 2008. "An exact approach for the single machine scheduling problem with linear early and quadratic tardy penalties. Asia-Pacific" Journal of Operational Research;
Valente, J.M.S. 2009. "A genetic algorithm approach for the single machischeduling problem with linear earliness and quadratic tardiness penalties." Computers & perations Research 36, 2707-2715.
Wagner, B.J., Davis, D.J, Kher, H., 2002."The production of several items in a single facility with linearly changing demand rates". Decision Sciences; 33:317–46.
Wang, X.R., Hung, X., Wang, J.B., 2011. " Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties". Applied Mathematical Modeling 35, 3509–3515..
)