Scheduling single machine with random breakdown and preemptive jobs

References

• Runge N, Sourd F. A new model for the preemptive earliness – tardiness scheduling problem. Comput Oper Res. 2009;36:2242–2249.10.1016/j.cor.2008.08.018
   Web of Science ®Google Scholar
• M’Hallah R. Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Comput Oper Res. 2007;34:3126–3142.10.1016/j.cor.2005.11.021
   Web of Science ®Google Scholar
• Bülbül K, Kaminsky P, Yano C. Preemption in single machine earliness/tardiness scheduling. J Sched. 2007;10:271–292.10.1007/s10951-007-0028-6
   Web of Science ®Google Scholar
• Hendel Y, Sourd F. An improved earliness – tardiness timing algorithm. Comput Oper Res. 2007;34:2931–2938.10.1016/j.cor.2005.11.004
   Web of Science ®Google Scholar
• Tian Z, Ng CT, Cheng TCE. Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness. Oper Res Lett. 2009;37:368–374.10.1016/j.orl.2009.04.004
   Web of Science ®Google Scholar
• Liao C-J, Cheng C-C. A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Comput Ind Eng. 2007;52:404–413.10.1016/j.cie.2007.01.004
   Web of Science ®Google Scholar
• Davis JS, Kanet JJ. Single-machine scheduling with early and tardy completion costs. Nav Res Logist. 1993;40:85–101.10.1002/(ISSN)1520-6750
   Web of Science ®Google Scholar
• Valente JMS. An exact approach for the single machine scheduling problem with linear early and quadratic tardy penalties. Asia-Pac J Oper Res. 2008;25:169–186.10.1142/S0217595908001730
   Web of Science ®Google Scholar
• Hendel Y, Runge N, Sourd F. The one-machine just-in-time scheduling problem with preemption. Discrete Optim. 2009;6:10–22.10.1016/j.disopt.2008.08.001
   Web of Science ®Google Scholar
• Valente JMS, Alves RAFS. Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Comput Oper Res. 2008;35:3696–3713.
   Web of Science ®Google Scholar
• Valente JMS, Gonçalves JF. A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput Oper Res. 2009;36:2707–2715.10.1016/j.cor.2008.11.016
   Web of Science ®Google Scholar
• Khorshidian H, Javadian N, Zandieh M, et al. A genetic algorithm for JIT single machine scheduling with preemption and machine idle time. Expert Syst Appl. 2011;38:7911–7918.10.1016/j.eswa.2010.10.066
   Web of Science ®Google Scholar
• Kazemi M, Nikoofarid E, Aalaei A, et al. Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process. Int J Ind Eng Comput. 2012;3:321–336.10.5267/j.ijiec
   Google Scholar
• Lenstra JK, Rinnooy Kan AHG, et al. Annals of discrete mathematics. Vol. 1. ELJBHKPL Hammer, GL Nemhauser, editors. Elsevier; 1977. p. 343–362.
   Google Scholar
• Gupta JND, Chantaravarapan S. Single machine group scheduling with family setups to minimize total tardiness. Int J Prod Res. 2007;46:1707–1722.
   Web of Science ®Google Scholar
• Shabtay D. Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. Comput Oper Res. 2008;35:1539–1545.10.1016/j.cor.2006.08.017
   Web of Science ®Google Scholar
• Schaller JE, Gupta JND. Single machine scheduling with family setups to minimize total earliness and tardiness. Eur J Oper Res. 2008;187:1050–1068.10.1016/j.ejor.2006.06.061
   Web of Science ®Google Scholar
• Wan G, Yen BPC. Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs. Eur J Oper Res. 2009;195:89–97.10.1016/j.ejor.2008.01.029
   Web of Science ®Google Scholar
• Hepdogan S, Moraga R, DePuy GW, et al. A Meta-RaPS for the early/tardy single machine scheduling problem. Int J Prod Res. 2009;47:1717–1732.10.1080/00207540701742427
   Web of Science ®Google Scholar
• Kedad-Sidhoum S, Sourd F. Fast neighborhood search for the single machine earliness – tardiness scheduling problem. Comput Oper Res. 2010;37:1464–1471.10.1016/j.cor.2009.11.002
   Web of Science ®Google Scholar
• Shirazi B, Fazlollahtabar H, Sahebjamnia N. Minimizing arbitrary earliness/tardiness penalties with common due date in single-machine scheduling problem using a tabu-geno-simulated annealing. Mater Manuf Processes. 2010;25:515–525.10.1080/10426910903365828
   Web of Science ®Google Scholar
• Kianfar K, Moslehi G. A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties. Comput Oper Res. 2012;39:2978–2990.10.1016/j.cor.2012.03.004
   Web of Science ®Google Scholar
• Montgomery DC. Design and analysis of experiments. Hoboken, NJ: John Wiley & Sons; 2008.
   Google Scholar
• Taguchi G. Introduction to quality engineering: designing quality into products and processes. Tokyo: Asian Productivity Organization; 1986.
   Google Scholar