___

• Abdekhodaee, A.H., Wirth,A., Gan,H.S.
• Scheduling two paralel machines with a single
• server: the general case. Computers &
• Operations Research.33, 994-1009, 2006.
• Abdekhodaee, A. H., Wirth, A. Scheduling
• parallel machines with a single server: Some
• solvable cases and heuristics. Computers and
• Operations Research.,29, 295-315, 2002.
• Allahverdi, A., Gupta, J. N., Aldowaisan, T. A
• review of scheduling research involving setup
• considerations. OMEGA The Int. Journal of
• Management Sciences.27,219-239,1999.
• Allahverdi, A., Mg, C. T., Cheng, T. C.,
• Kovalyov, M. Y. A survey of scheduling
• problems with setup times or costs. European
• Journal of Operational Research.187,985-
• ,2008.
• Armento, V. A., Yamashita, D. S. Tabu search for
• scheduling on identical parallel machines to
• minimize mean tardiness. Journal of Intelligent
• Manufacturing. 11,453-460,2000.
• Bilge, U., Kirac, F., Kurtulan, M., Pekgun, P.A.
• Tabu search algorithm for parallel machine total
• tardiness problem. Computers and Operations
• Research. 31,397-414,2004.
• Cheng, T., C., E., Gupta, J., N., D., Wang, G. A
• review of flowshop scheduling research with
• setup times. Production and Operations
• Managament. 9,262-282,2010.
• Gendreau, M., Laporte, G., Guimaraes, E. M. A
• divide and merge heuristic for the multiprocessor
• scheduling problem with sequence dependent
• setup times. European Journal of Operational
• Research. 133,183-189,2001.
• Glover, F., Kochenberger, G. A. Handbook of
• metaheuristics. Kluwer Academic Publishers.
• New York. 2003.
• Guinet, A.Scheduling sequence dependent jobs on
• identical parallel machines to minimize
• completion time criteria. Int. J. Prod. Res. 31(7),
• -1594,1993.
• Huang, S., Chai, L., Zhang, X. Parallel dedicated
• machine scheduling problem with sequencedependent
• setups and a single server.
• Computers& Industrial Engineering. 58,165-
• ,2009.
• Kellegoz, T., Toklu, B., Wilson, J, Comparing
• efficiencies of genetic crossover operators for one
• machine total weighted tardiness problem.
• Applied Mathematics and Computation.
• ,590-598,2008.
• Kellegoz, T., Toklu, B., Wilson, J. Elite guided
• steady-state genetic algorithm for minimizing
• total tardiness in flowshops. Computers &
• Industrial Eng. 58,300-306,2010.
• Kim, S. S., Shin, H. J., Eom, D. H., Kim, C. O. A
• due date density-based categorising heuristic for
• parallel machines scheduling. Int J. Adv. Manuf.
• Technol. 22,753-760,2003.
• Kim, C. O., Shin, H. J. Scheduling jobs on
• parallel machines: a restricted tabu search
• approach. Int. J. Adv. Manuf. Technol. 22,278-
• ,2003.
• Kurz, M. E., Askin, R. G. Heuristic scheduling of
• parallel machines with sequence-dependent set-up
• times. Int. J. Prod. Res. 39(16),3747-3769,2001.
• McNaughton, R. Scheduling with deadlines and
• loss functions. Management Science.,6,1-
• ,1959.
• Montoya-Torres, J.R., Soto-Ferrari, M.,
• Gonzalez-Solano, F., Alfonso-Lizarazo, E.
• Machine Scheduling with Sequence-dependent
• Setup Times using a Randomized Search
• Heuristic. Proceedings of the 39th International
• Conference on Computers and Industrial
• Engineering (CIE-39),28-33,2009.
• Sel, C. Scheduling parallel machines using
• genetic algorithms with sequence dependent setup
• times and a single server. Masters thesis,
• Kirikkale University, Kirikkale, August 2010.
• Sivriaya, F., Ulusoy, G. Parallel machine
• scheduling with earliness and tardiness penalties.
• Computers & Operations Research.,26,773-
• , 1999.
• Turker, A. K., Sel, C. Scheduling two parallel
• machines with sequence- dependent setups and a
• single server. G.U Journal of Science.24,1,113-
• ,2011.
• Wilson, A. D., King, R. E., Hodgson, T. J.
• Scheduling non-similar groups on a flow line:
• multiple group setups. Robotics and Computer-
• Integrated Manufacturing,20,505-515,2004.
• Yang, W., Liao, C. Survey of scheduling research
• involving setup times. International Journal of
• Systems Science,30,143-155,2010.