Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 340769, 8 pages
http://dx.doi.org/10.1155/2015/340769
Research Article

A Decomposition-Based Two-Stage Optimization Algorithm for Single Machine Scheduling Problems with Deteriorating Jobs

School of Economics and Management, Nanchang University, Nanchang 330031, China

Received 14 February 2015; Revised 7 May 2015; Accepted 12 May 2015

Academic Editor: Marco Mussetta

Copyright © 2015 Yueyue Liu 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. 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 Publisher · View at Google Scholar · View at Scopus
  2. E. L. Lawler, “A pseudo polynomial algorithm for sequencing jobs to minimize total tardiness,” Annals of Discrete Mathematics, vol. 1, pp. 331–342, 1997. View at Google Scholar
  3. J. K. Lenstra, A. G. H. Rinnooy Kan, and P. Brucker, “Complexity of machine scheduling problems,” Annals of Discrete Mathematics, vol. 1, pp. 343–362, 1997. View at Google Scholar
  4. R. K. Congram, C. N. Potts, and S. L. van de Velde, “An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem,” INFORMS Journal on Computing, vol. 14, no. 1, pp. 52–67, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  5. W. Bozejko, J. Grabowski, and M. Wodecki, “Block approach-tabu search algorithm for single machine total weighted tardiness problem,” Computers and Industrial Engineering, vol. 50, no. 1-2, pp. 1–14, 2006. View at Publisher · View at Google Scholar · View at Scopus
  6. J. N. D. Gupta and S. K. Gupta, “Single facility scheduling with nonlinear processing times,” Computers & Industrial Engineering, vol. 14, no. 4, pp. 387–393, 1988. View at Publisher · View at Google Scholar · View at Scopus
  7. 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
  8. J.-B. Wang and J.-J. Wang, “Single-machine scheduling problems with precedence constraints and simple linear deterioration,” Applied Mathematical Modelling, vol. 39, no. 3-4, pp. 1172–1182, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  9. 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 · View at MathSciNet · View at Scopus
  10. A. Bachman, T. C. E. Cheng, A. Janiak, and C. T. Ng, “Scheduling start time dependent jobs to minimize the total weighted completion time,” Journal of the Operational Research Society, vol. 53, no. 6, pp. 688–693, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. 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 MathSciNet · View at Scopus
  12. Y. S. Hsu and B. M. T. Lin, “Minimization of maximum lateness under linear deterioration,” Omega, vol. 31, no. 6, pp. 459–469, 2003. View at Publisher · View at Google Scholar · View at Scopus
  13. 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 Scopus
  14. K. Rustogi and V. A. Strusevich, “Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance,” Journal of the Operational Research Society, vol. 66, no. 3, pp. 500–515, 2014. View at Publisher · View at Google Scholar
  15. J. Liu, Y. Wang, and X. Min, “Single-machine scheduling with common due-window assignment for deteriorating jobs,” Journal of the Operational Research Society, vol. 65, no. 2, pp. 291–301, 2014. View at Publisher · View at Google Scholar · View at Scopus
  16. D. Oron, “Scheduling controllable processing time jobs in a deteriorating environment,” Journal of the Operational Research Society, vol. 65, no. 1, pp. 49–56, 2014. View at Publisher · View at Google Scholar · View at Scopus
  17. K. Rustogi and V. A. Strusevich, “Single machine scheduling with general positional deterioration and rate-modifying maintenance,” Omega, vol. 40, no. 6, pp. 791–804, 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Gawiejnowicz, W.-C. Lee, C.-L. Lin, and C.-C. Wu, “Single-machine scheduling of proportionally deteriorating jobs by two agents,” Journal of the Operational Research Society, vol. 62, no. 11, pp. 1983–1991, 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. V. Sels and M. Vanhoucke, “A hybrid dual-population genetic algorithm for the single machine maximum lateness problem,” in Evolutionary Computation in Combinatorial Optimization, vol. 6622 of Lecture Notes in Computer Science, pp. 14–25, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  20. T. G. Voutsinas and C. P. Pappis, “A branch and bound algorithm for single machine scheduling with deteriorating values of jobs,” Mathematical and Computer Modelling, vol. 52, no. 1-2, pp. 55–61, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. F. Jolai, M. Rabbani, S. Amalnick, A. Dabaghi, M. Dehghan, and M. Y. Parast, “Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs,” Applied Mathematics and Computation, vol. 194, no. 2, pp. 552–560, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  22. S. H. Pakzad-Moghaddam, H. Mina, and R. Tavakkoli-Moghaddam, “An approach for modeling a new single machine scheduling problem with deteriorating and learning effects,” Computers & Industrial Engineering, vol. 78, pp. 33–43, 2014. View at Publisher · View at Google Scholar
  23. H. Xu, Z. Lü, A. Yin, L. Shen, and U. Buscher, “A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times,” Computers and Operations Research, vol. 50, pp. 47–60, 2014. View at Publisher · View at Google Scholar · View at Scopus
  24. D. Xu, L. Wan, A. Liu, and D.-L. Yang, “Single machine total completion time scheduling problem with workload-dependent maintenance duration,” Omega, vol. 52, pp. 101–106, 2015. View at Google Scholar
  25. E. R. Gafarov, A. A. Lazarev, and F. Werner, “Single machine scheduling problems with financial resource constraints: some complexity results and properties,” Mathematical Social Sciences, vol. 62, no. 1, pp. 7–13, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. Y. Yin, T. C. E. Cheng, C.-J. Hsu, and C.-C. Wu, “Single-machine batch delivery scheduling with an assignable common due window,” Omega, vol. 41, no. 2, pp. 216–225, 2013. View at Publisher · View at Google Scholar · View at Scopus
  27. D. Xu, M. Liu, Y. Yin, and J. Hao, “Scheduling tool changes and special jobs on a single machine to minimize makespan,” Omega, vol. 41, no. 2, pp. 299–304, 2013. View at Publisher · View at Google Scholar · View at Scopus
  28. Y. Yin, S.-R. Cheng, T. C. E. Cheng, W.-H. Wu, and C.-C. Wu, “Two-agent single-machine scheduling with release times and deadlines,” International Journal of Shipping and Transport Logistics, vol. 5, no. 1, pp. 75–94, 2013. View at Publisher · View at Google Scholar · View at Scopus