Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 138240, 7 pages
http://dx.doi.org/10.1155/2013/138240
Research Article

Rescheduling Problems with Agreeable Job Parameters to Minimize the Tardiness Costs under Deterioration and Disruption

1College of Economics and Business Administration, Chongqing University, Chongqing 400030, China
2College of Mathematical Sciences, Chongqing Normal University, Chongqing 400047, China

Received 21 May 2013; Accepted 18 July 2013

Academic Editor: Yunqiang Yin

Copyright © 2013 Zhang Xingong and Wang Yong. 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. 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 · View at MathSciNet
  3. G. Mosheiov, “Scheduling jobs under simple linear deterioration,” Computers and Operations Research, vol. 21, no. 6, pp. 653–659, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. 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 · View at MathSciNet
  5. S. Gawiejnowicz, Time-Dependent Scheduling, Springer, Berlin, Germany, 2008. View at MathSciNet
  6. D. Biskup and J. Herrmann, “Single-machine scheduling against due dates with past-sequence-dependent setup times,” European Journal of Operational Research, vol. 191, no. 2, pp. 587–592, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. J.-B. Wang and Q. Guo, “A due-date assignment problem with learning effect and deteriorating jobs,” Applied Mathematical Modelling, vol. 34, no. 2, pp. 309–313, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. C. T. Ng, J.-B. Wang, T. C. E. Cheng, and L. L. Liu, “A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs,” Computers & Operations Research, vol. 37, no. 1, pp. 83–90, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. T. C. E. Cheng, W.-C. Lee, and C.-C. Wu, “Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times,” Applied Mathematical Modelling, vol. 35, no. 4, pp. 1861–1867, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. N. Raman, F. B. Talbot, and R. V. Rachamadugu, “Due date based scheduling in a general flexible manufacturing system,” Journal of Operations Management, vol. 8, no. 2, pp. 115–132, 1989. View at Publisher · View at Google Scholar · View at Scopus
  11. L. K. Church and R. Uzsoy, “Analysis of periodic and event-driven rescheduling policies in dynamic shops,” International Journal of Computer Integrated Manufacturing, vol. 5, pp. 153–163, 1992. View at Publisher · View at Google Scholar
  12. A. K. Jain and H. A. Elmaraghy, “Production scheduling/rescheduling in flexible manufacturing,” International Journal of Production Research, vol. 35, no. 1, pp. 281–309, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. G. E. Vieira, J. W. Herrmann, and E. Lin, “Rescheduling manufacturing systems: a framework of strategies, policies, and methods,” Journal of Scheduling, vol. 6, no. 1, pp. 39–62, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  14. B. B. Yang, “Single machine rescheduling with new jobs arrivals and processing time compression,” International Journal of Advanced Manufacturing Technology, vol. 34, no. 3-4, pp. 378–384, 2007. View at Publisher · View at Google Scholar · View at Scopus
  15. N. G. Hall and C. N. Potts, “Rescheduling for new orders,” Operations Research, vol. 52, no. 3, pp. 440–453, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. J. J. Yuan and Y. D. Mu, “Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption,” European Journal of Operational Research, vol. 182, no. 2, pp. 936–944, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. C. L. Zhao and H. Y. Tang, “Rescheduling problems with deteriorating jobs under disruptions,” Applied Mathematical Modelling, vol. 34, no. 1, pp. 238–243, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. H. Hoogeveen, C. Lenté, and V. T'kindt, “Rescheduling for new orders on a single machine with setup times,” European Journal of Operational Research, vol. 223, no. 1, pp. 40–46, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. J. Du and J. Y.-T. 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 Zentralblatt MATH · View at MathSciNet
  20. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. 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 Zentralblatt MATH · View at MathSciNet
  21. A. Kononov and S. Gawiejnowicz, “NP-hard cases in scheduling deteriorating jobs on dedicated machines,” Journal of the Operational Research Society, vol. 52, no. 6, pp. 708–717, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus