About this Journal Submit a Manuscript Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 928312, 20 pages
http://dx.doi.org/10.1155/2012/928312
Research Article

Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

1School of Mechanical Engineering, Southwest Jiaotong University, Chengdu 610031, China
2School of Mechanical Engineering and Automation, Xihua University, Chengdu 610039, China

Received 20 February 2012; Revised 27 April 2012; Accepted 8 May 2012

Academic Editor: Jung-Fa Tsai

Copyright © 2012 Wenming Cheng et al. 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. S. Browne and U. Yechiali, “Scheduling deteriorating jobs on a single processor,” Operations Research, vol. 38, no. 3, pp. 495–498, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. J. N. D. Gupta and S. K. Gupta, “Single facility scheduling with nonlinear processing times,” Computers and Industrial Engineering, vol. 14, no. 4, pp. 387–393, 1988. View at Publisher · View at Google Scholar · View at Scopus
  3. A. Bachman and A. Janiak, “Minimizing maximum lateness under linear deterioration,” European Journal of Operational Research, vol. 126, no. 3, pp. 557–566, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. A. Bachman, A. Janiak, and M. Y. Kovalyov, “Minimizing the total weighted completion time of deteriorating jobs,” Information Processing Letters, vol. 81, no. 2, pp. 81–84, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. C.-C. Wu, W.-C. Lee, and Y.-R. Shiau, “Minimizing the total weighted completion time on a single machine under linear deterioration,” International Journal of Advanced Manufacturing Technology, vol. 33, no. 11-12, pp. 1237–1243, 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. J.-B. Wang, L. Lin, and F. Shan, “Single-machine group scheduling problems with deteriorating jobs,” International Journal of Advanced Manufacturing Technology, vol. 39, no. 7-8, pp. 808–812, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. J.-B. Wang, C. T. Ng, and T. C. E. Cheng, “Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint,” Computers & Operations Research, vol. 35, no. 8, pp. 2684–2693, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. M. M. Mazdeh, F. Zaerpour, A. Zareei, and A. Hajinezhad, “Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs,” Applied Mathematical Modelling, vol. 34, no. 6, pp. 1498–1510, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. L. Sun, L. Sun, K. Cui, and J. B. Wang, “A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines,” European Journal of Operational Research, vol. 200, no. 1, pp. 309–311, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. D. Wang and J. B. Wang, “Single-machine scheduling with simple linear deterioration to minimize earliness penalties,” International Journal of Advanced Manufacturing Technology, vol. 46, no. 1–4, pp. 285–290, 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. J.-B. Wang, “Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan,” International Journal of Advanced Manufacturing Technology, vol. 48, no. 5–8, pp. 719–723, 2010. View at Publisher · View at Google Scholar · View at Scopus
  12. C.-M. Wei and J.-B. Wang, “Single machine quadratic penalty function scheduling with deteriorating jobs and group technology,” Applied Mathematical Modelling, vol. 34, no. 11, pp. 3642–3647, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. X. Huang and M.-Z. Wang, “Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties,” Applied Mathematical Modelling, vol. 35, no. 3, pp. 1349–1353, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. J.-B. Wang and C. Wang, “Single-machine due-window assignment problem with learning effect and deteriorating jobs,” Applied Mathematical Modelling, vol. 35, no. 8, pp. 4017–4022, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. J.-B. Wang, J.-J. Wang, and P. Ji, “Scheduling jobs with chain precedence constraints and deteriorating jobs,” Journal of the Operational Research Society, vol. 62, no. 9, pp. 1765–1770, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. J.-B. Wang and C.-M. Wei, “Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties,” Applied Mathematics and Computation, vol. 217, no. 20, pp. 8093–8099, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. S.-H. Yang and J.-B. Wang, “Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration,” Applied Mathematics and Computation, vol. 217, no. 9, pp. 4819–4826, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. J.-B. Wang and M.-Z. Wang, “Single-machine scheduling with nonlinear deterioration,” Optimization Letters, vol. 6, no. 1, pp. 87–98, 2012. View at Publisher · View at Google Scholar
  19. J.-B. Wang, M.-Z. Wang, and P. Ji, “Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs,” International Journal of Systems Science, vol. 43, no. 5, pp. 861–868, 2012. View at Publisher · View at Google Scholar · View at Scopus
  20. B. Alidaee and N. K. Womer, “Scheduling with time dependent processing times: review and extensions,” Journal of the Operational Research Society, vol. 50, no. 7, pp. 711–720, 1999. View at Zentralblatt MATH · View at Scopus
  21. T. C. E. Cheng, Q. Ding, and B. M. T. Lin, “A concise survey of scheduling with time-dependent processing times,” European Journal of Operational Research, vol. 152, no. 1, pp. 1–13, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. P. S. Sundararaghavan and A. S. Kunnathur, “Single machine scheduling with start time dependent processing times: some solvable cases,” European Journal of Operational Research, vol. 78, no. 3, pp. 394–403, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  23. W. Kubiak and S. van de Velde, “Scheduling deteriorating jobs to minimize makespan,” Naval Research Logistics, vol. 45, no. 5, pp. 511–523, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  24. T. C. E. Cheng and Q. Ding, “Single machine scheduling with step-deteriorating processing times,” European Journal of Operational Research, vol. 134, no. 3, pp. 623–630, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  25. P. Hansen and N. Mladenović, “Variable neighborhood search: principles and applications,” European Journal of Operational Research, vol. 130, no. 3, pp. 449–467, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  26. N. Mladenović and P. Hansen, “Variable neighborhood search,” Computers & Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  27. A. S. Kunnathur and S. K. Gupta, “Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem,” European Journal of Operational Research, vol. 47, no. 1, pp. 56–64, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  28. G. Mosheiov, “Scheduling jobs with step-deterioration; Minimizing makespan on a single- and multi-machine,” Computers and Industrial Engineering, vol. 28, no. 4, pp. 869–879, 1995. View at Publisher · View at Google Scholar · View at Scopus
  29. A. A. K. Jeng and B. M. T. Lin, “Makespan minimization in single-machine scheduling with step-deterioration of processing times,” Journal of the Operational Research Society, vol. 55, no. 3, pp. 247–256, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  30. A. A. K. Jeng and B. M. T. Lin, “Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs,” Computers and Operations Research, vol. 32, no. 3, pp. 521–536, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  31. C.-C. He, C.-C. Wu, and W.-C. Lee, “Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs,” Journal of the Operational Research Society, vol. 60, no. 12, pp. 1759–1766, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  32. J. Layegh, F. Jolai, and M. S. Amalnik, “A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration,” Advances in Engineering Software, vol. 40, no. 10, pp. 1074–1077, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  33. M. Y. Kovalyov and W. Kubiak, “A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs,” Journal of Heuristics, vol. 3, no. 4, pp. 287–297, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  34. T. C. E. Cheng, Q. Ding, M. Y. Kovalyov, A. Bachman, and A. Janiak, “Scheduling jobs with piecewise linear decreasing processing times,” Naval Research Logistics, vol. 50, no. 6, pp. 531–554, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  35. G. Moslehi and A. Jafari, “Minimizing the number of tardy jobs under piecewise-linear deterioration,” Computers and Industrial Engineering, vol. 59, no. 4, pp. 573–584, 2010. View at Publisher · View at Google Scholar · View at Scopus
  36. 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 Zentralblatt MATH · View at Scopus
  37. M. R. D. Paula, M. G. Ravetti, G. R. Mateus, and P. M. Pardalos, “Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search,” IMA Journal of Management Mathematics, vol. 18, no. 2, pp. 101–115, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  38. D. Anghinolfi and M. Paolucci, “Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach,” Computers & Operations Research, vol. 34, no. 11, pp. 3471–3490, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  39. R. Driessel and L. Mönch, “Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times,” Computers and Industrial Engineering, vol. 61, no. 2, pp. 336–345, 2011. View at Publisher · View at Google Scholar · View at Scopus
  40. J. Behnamian, M. Zandieh, and S. M. T. F. Ghomi, “Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm,” Expert Systems with Applications, vol. 36, no. 6, pp. 9637–9644, 2009. View at Publisher · View at Google Scholar · View at Scopus
  41. C.-L. Chen and C.-L. Chen, “Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times,” International Journal of Advanced Manufacturing Technology, vol. 43, no. 1-2, pp. 161–169, 2009. View at Publisher · View at Google Scholar · View at Scopus
  42. J. Gao, L. Sun, and M. Gen, “A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems,” Computers & Operations Research, vol. 35, no. 9, pp. 2892–2907, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  43. V. Roshanaei, B. Naderi, F. Jolaib, and M. Khalili, “A variable neighborhood search for job shop scheduling with set-up times to minimize makespan,” Future Generation Computer Systems, vol. 25, no. 6, pp. 654–661, 2009. View at Publisher · View at Google Scholar · View at Scopus
  44. M. A. Adibi, M. Zandieh, and M. Amiri, “Multi-objective scheduling of dynamic job shop using variable neighborhood search,” Expert Systems with Applications, vol. 37, no. 1, pp. 282–287, 2010. View at Publisher · View at Google Scholar · View at Scopus
  45. M. Amiri, M. Zandieh, M. Yazdani, and A. Bagheri, “A variable neighbourhood search algorithm for the flexible job-shop scheduling problem,” International Journal of Production Research, vol. 48, no. 19, pp. 5671–5689, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  46. P. Hansen, N. Mladenović, and J. A. M. Pérez, “Variable neighbourhood search: methods and applications,” Annals of Operations Research, vol. 175, pp. 367–407, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  47. M. L. Pinedo, Scheduling: Theory, Algorithms and Systems, Springer, New York, NY, USA, 2008.
  48. C. Ferreira, “Combinatorial optimization by gene expression programming: inversion revisited,” in Proceedings of the Argentine Symposium on Artificial Intelligence, pp. 160–174, Santa Fe, NM, USA, 2002.