Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2016 (2016), Article ID 9598041, 15 pages
http://dx.doi.org/10.1155/2016/9598041
Research Article

ILS Heuristics for the Single-Machine Scheduling Problem with Sequence-Dependent Family Setup Times to Minimize Total Tardiness

Department of Computer Science, Universidade Federal de Viçosa, 36570-900 Viçosa, MG, Brazil

Received 19 August 2016; Revised 15 September 2016; Accepted 19 September 2016

Academic Editor: Quanke Pan

Copyright © 2016 Vinícius Vilar Jacob and José Elias C. Arroyo. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Allahverdi, C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov, “A survey of scheduling problems with setup times or costs,” European Journal of Operational Research, vol. 187, no. 3, pp. 985–1032, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. A. Allahverdi, “The third comprehensive survey on scheduling problems with setup times/costs,” European Journal of Operational Research, vol. 246, no. 2, pp. 345–378, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. J.-B. Wang and J.-J. Wang, “Single machine group scheduling with time dependent processing times and ready times,” Information Sciences, vol. 275, pp. 226–231, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. J. Du and J. Y. Leung, “Minimizing total tardiness on one machine is NP-hard,” Mathematics of Operations Research, vol. 15, no. 3, pp. 483–495, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  6. S. Chantaravarapan, J. N. D. Gupta, and M. L. Smith, “A hybrid genetic algorithm for minimizing total tardiness on a single machine with family setups,” in Proceedings of the Production and Operations Management Society Meeting (POMS '03), pp. 1–35, Savannah, Ga, USA, April 2003.
  7. P. A. Rubin and G. L. Ragatz, “Scheduling in a sequence dependent setup environment with genetic search,” Computers & Operations Research, vol. 22, no. 1, pp. 85–99, 1995. View at Publisher · View at Google Scholar · View at Scopus
  8. V. A. Armentano and R. Mazzini, “A genetic algorithm for scheduling on a single machine with set-up times and due dates,” Production Planning & Control, vol. 11, no. 7, pp. 713–720, 2000. View at Publisher · View at Google Scholar · View at Scopus
  9. P. M. França, A. Mendes, and P. Moscato, “A memetic algorithm for the total tardiness single machine scheduling problem,” European Journal of Operational Research, vol. 132, no. 1, pp. 224–242, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. A. Sioud, M. Gravel, and C. Gagné, “A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times,” Computers & Operations Research, vol. 39, no. 10, pp. 2415–2424, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. K. C. Tan and R. Narasimhan, “Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach,” Omega, vol. 25, no. 6, pp. 619–634, 1997. View at Publisher · View at Google Scholar · View at Scopus
  12. C. Gagné, W. L. Price, and M. Gravel, “Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times,” Journal of the Operational Research Society, vol. 53, no. 8, pp. 895–906, 2002. View at Publisher · View at Google Scholar · View at Scopus
  13. C.-J. Liao and H.-C. Juan, “An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups,” Computers & Operations Research, vol. 34, no. 7, pp. 1899–1909, 2007. View at Publisher · View at Google Scholar · View at Scopus
  14. S. R. Gupta and J. S. Smith, “Algorithms for single machine total tardiness scheduling with sequence dependent setups,” European Journal of Operational Research, vol. 175, no. 2, pp. 722–739, 2006. View at Publisher · View at Google Scholar · View at Scopus
  15. H. Akrout, B. Jarboui, P. Siarry, and A. Rebaï, “A GRASP based on DE to solve single machine scheduling problem with SDST,” Computational Optimization and Applications, vol. 51, no. 1, pp. 411–435, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. J. E. C. Arroyo, G. V. P. Nunes, and E. H. Kamke, “Iterative local search heuristic for the single machine scheduling problem with sequence dependent setup times and due dates,” in Proceedings of the 9th International Conference on Hybrid Intelligent Systems (HIS '09), vol. 1, pp. 505–510, IEEE, Shenyang, China, August 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. K.-C. Ying, S.-W. Lin, and C.-Y. Huang, “Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic,” Expert Systems with Applications, vol. 36, no. 3, pp. 7087–7092, 2009. View at Publisher · View at Google Scholar · View at Scopus
  18. G. L. Ragatz, “A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times,” in Proceedings of the 24th Annual Meeting of the Decision Sciences Institute, pp. 1375–1377, John Wiley & Sons, 1993.
  19. X. Luo and F. Chu, “A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness,” Applied Mathematics and Computation, vol. 183, no. 1, pp. 575–588, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. E. C. Sewell, J. J. Sauppe, D. R. Morrison, S. H. Jacobson, and G. K. Kao, “A BB’R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times,” Journal of Global Optimization, vol. 54, no. 4, pp. 791–812, 2012. View at Publisher · View at Google Scholar · View at Scopus
  21. S. Tanaka and M. Araki, “An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times,” Computers & Operations Research, vol. 40, no. 1, pp. 344–352, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Kacem, “Lower bounds for tardiness minimization on a single machine with family setup times,” in Proceedings of the IMACS Multiconference on Computational Engineering in Systems Applications, vol. 1, pp. 1034–1039, Beijing, China, 2006. View at Publisher · View at Google Scholar
  23. J. Schaller, “Scheduling on a single machine with family setups to minimize total tardiness,” International Journal of Production Economics, vol. 105, no. 2, pp. 329–344, 2007. View at Publisher · View at Google Scholar · View at Scopus
  24. J. C.-H. Pan and C.-S. Su, “Single machine scheduling with due dates and class setups,” Journal of the Chinese Institute of Engineers, vol. 20, no. 5, pp. 561–572, 1997. View at Google Scholar · View at Scopus
  25. K. R. Baker and M. J. Magazine, “Minimizing maximum lateness with job families,” European Journal of Operational Research, vol. 127, no. 1, pp. 126–139, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. J. E. Schaller and J. N. Gupta, “Single machine scheduling with family setups to minimize total earliness and tardiness,” European Journal of Operational Research, vol. 187, no. 3, pp. 1050–1068, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. J. N. D. Gupta and S. Chantaravarapan, “Single machine group scheduling with family setups to minimize total tardiness,” International Journal of Production Research, vol. 46, no. 6, pp. 1707–1722, 2008. View at Publisher · View at Google Scholar · View at Scopus
  28. J. A. van der Veen, G. J. Woeginger, and S. Zhang, “Sequencing jobs that require common resources on a single machine: a solvable case of the TSP,” Mathematical Programming, vol. 82, no. 1-2, pp. 235–254, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  29. S. Karabati and C. Akkan, “Minimizing sum of completion times on a single machine with sequence-dependent family setup times,” Journal of the Operational Research Society, vol. 57, no. 3, pp. 271–280, 2006. View at Publisher · View at Google Scholar · View at Scopus
  30. F. Jin, S. Song, and C. Wu, “A simulated annealing algorithm for single machine scheduling problems with family setups,” Computers & Operations Research, vol. 36, no. 7, pp. 2133–2138, 2009. View at Publisher · View at Google Scholar · View at Scopus
  31. F. Jin, S. Shiji, and W. Cheng, “Dominance property based tabu search for single machine scheduling problems with family setups,” Journal of Systems Engineering and Electronics, vol. 20, no. 6, pp. 1233–1238, 2009. View at Google Scholar
  32. F. Jin, J. N. D. Gupta, S. Song, and C. Wu, “Single machine scheduling with sequence-dependent family setups to minimize maximum lateness,” Journal of the Operational Research Society, vol. 61, no. 7, pp. 1181–1189, 2010. View at Publisher · View at Google Scholar · View at Scopus
  33. V. Sels and M. Vanhoucke, “A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups,” Computers & Operations Research, vol. 39, no. 10, pp. 2346–2358, 2012. View at Publisher · View at Google Scholar · View at Scopus
  34. O. Herr and A. Goel, “Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints,” European Journal of Operational Research, vol. 248, no. 1, pp. 123–135, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  35. P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, and D. Van Oudheusden, “Iterated local search for the team orienteering problem with time windows,” Computers & Operations Research, vol. 36, no. 12, pp. 3281–3290, 2009. View at Publisher · View at Google Scholar · View at Scopus
  36. P. H. V. Penna, A. Subramanian, and L. S. Ochi, “An iterated local search heuristic for the heterogeneous fleet vehicle routing problem,” Journal of Heuristics, vol. 19, no. 2, pp. 201–232, 2013. View at Publisher · View at Google Scholar · View at Scopus
  37. I. Ribas, R. Companys, and X. Tort-Martorell, “An efficient iterated local search algorithm for the total tardiness blocking flow shop problem,” International Journal of Production Research, vol. 51, no. 17, pp. 5238–5252, 2013. View at Publisher · View at Google Scholar · View at Scopus
  38. P. Vansteenwegen and M. Mateo, “An iterated local search algorithm for the single-vehicle cyclic inventory routing problem,” European Journal of Operational Research, vol. 237, no. 3, pp. 802–813, 2014. View at Publisher · View at Google Scholar · View at Scopus
  39. J. Brandão, “A deterministic iterated local search algorithm for the vehicle routing problem with backhauls,” TOP, vol. 24, no. 2, pp. 445–465, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  40. X. Dong, H. Huang, and P. Chen, “An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion,” Computers & Operations Research, vol. 36, no. 5, pp. 1664–1669, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  41. L. Fanjul-Peyro and R. Ruiz, “Iterated greedy local search methods for unrelated parallel machine scheduling,” European Journal of Operational Research, vol. 207, no. 1, pp. 55–69, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  42. F. Della Croce, T. Garaix, and A. Grosso, “Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem,” Computers & Operations Research, vol. 39, no. 6, pp. 1213–1217, 2012. View at Publisher · View at Google Scholar · View at Scopus
  43. H. Xu, Z. Lü, and T. C. Cheng, “Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness,” Journal of Scheduling, vol. 17, no. 3, pp. 271–287, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  44. X. Dong, M. Nowak, P. Chen, and Y. Lin, “Self-adaptive perturbation and multi-neighborhood search for iterated local search on the permutation flow shop problem,” Computers & Industrial Engineering, vol. 87, pp. 176–185, 2015. View at Publisher · View at Google Scholar · View at Scopus
  45. V. L. A. Santos, J. E. C. Arroyo, and T. F. Carvalho, “Iterated local search based heuristic for scheduling jobs on unrelated parallel machines with machine deterioration effect,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 53–54, ACM, Denver, Colo, USA, July 2016. View at Publisher · View at Google Scholar
  46. H. R. Lourenço, O. C. Martin, and T. Stützle, “Iterated local search,” in Handbook of Metaheuristics, F. Glover and G. A. Kochenberger, Eds., vol. 57 of International Series in Operations Research & Management Science, chapter 11, pp. 320–353, Kluwer Academic, 2003. View at Publisher · View at Google Scholar
  47. H. R. Lourenço, O. C. Martin, and T. Stützle, “Iterated local search: framework and applications,” in Handbook of Metaheuristics, pp. 363–397, Springer, Berlin, Germany, 2010. View at Google Scholar
  48. P. Hansen and N. Mladenović, “Variable neighborhood search,” in Search Methodologies, pp. 313–337, Springer, Berlin, Germany, 2014. View at Google Scholar
  49. M. Laguna and R. Martí, “GRASP and path relinking for 2-layer straight line crossing minimization,” INFORMS Journal on Computing, vol. 11, no. 1, pp. 44–52, 1999. View at Publisher · View at Google Scholar · View at Scopus
  50. F. Glover, “Tabu search and adaptive memory programing-advances, applications and challenges,” in Interfaces in Computer Science and Operations Research, R. S. Barr, R. V. Helgason, and J. L. Kennington, Eds., Operations Research/Computer Science Interfaces Series, pp. 1–75, Springer, New York, NY, USA, 1996. View at Google Scholar
  51. M. Nawaz, E. E. Enscore Jr., and I. Ham, “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” Omega, vol. 11, no. 1, pp. 91–95, 1983. View at Publisher · View at Google Scholar · View at Scopus
  52. M. G. C. Resende and C. C. Ribeiro, “Handbook of metaheuristics,” in Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications, M. Gendreau and J. Y. Potvin, Eds., pp. 219–249, Springer, Berlin, Germany, 2nd edition, 2010. View at Google Scholar
  53. E. Vallada, R. Ruiz, and G. Minella, “Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics,” Computers & Operations Research, vol. 35, no. 4, pp. 1350–1373, 2008. View at Publisher · View at Google Scholar · View at Scopus
  54. D. C. Montgomery, Design and Analysis of Experiments, John Wiley & Sons, New York, NY, USA, 2006.
  55. M. den Besten and T. Stützle, “Neighborhoods revisited: an experimental investigation into the effectiveness of variable neighborhood descent for scheduling,” in Proceedings of the 4th Metaheuristics International Conference, pp. 545–549, 2001.
  56. A. Subramanian, M. Battarra, and C. N. Potts, “An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times,” International Journal of Production Research, vol. 52, no. 9, pp. 2729–2742, 2014. View at Publisher · View at Google Scholar · View at Scopus
  57. R. M. Aiex, M. G. Resende, and C. C. Ribeiro, “Ttt plots: a perl program to create time-to-target plots,” Optimization Letters, vol. 1, no. 4, pp. 355–366, 2007. View at Publisher · View at Google Scholar