Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 748905, 5 pages
http://dx.doi.org/10.1155/2014/748905
Research Article

Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment

School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, China

Received 13 May 2014; Revised 7 July 2014; Accepted 7 July 2014; Published 22 July 2014

Academic Editor: Ming Liu

Copyright © 2014 Long Wan. 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. T. C. E. Cheng and S. Podolsky, Just-in-Time Manufacturing: An Introduction, Chapman & Hall, London, UK, 1996.
  2. T. C. E. Cheng and M. C. Gupta, “Survey of scheduling research involving due date determination decisions,” European Journal of Operational Research, vol. 38, no. 2, pp. 156–166, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. K. R. Baker and G. D. Scudder, “Sequencing with earliness and tardiness penalties: a review,” Operations Research, vol. 38, no. 1, pp. 22–35, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. V. S. Gordon, J. M. Proth, and C. Chu, “A survey of the state-of-the-art of common due date assignment and scheduling research,” European Journal of Operational Research, vol. 139, no. 1, pp. 1–25, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. D. Xu, C.-L. Li, and Q. Han, “A note on parallel-machine due-window assignment,” Journal of the Operational Research Society, vol. 63, no. 6, pp. 821–825, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. E. Gerstl and G. Mosheiov, “Minmax due-date assignment with a time window for acceptable lead-times,” Annals of Operations Research, vol. 211, pp. 167–177, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. Y. Yin, T. C. E. Cheng, C. Hsu, and 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
  8. A. Janiak, W. Janiak, M. Y. Kovalyov, E. Kozan, and E. Pesch, “Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs,” Information Sciences, vol. 224, pp. 109–117, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. C. Lee, “Machine scheduling with an availability constraint,” Journal of Global Optimization, vol. 9, no. 3-4, pp. 395–416, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. C.-Y. Lee and Z.-L. Chen, “Scheduling jobs and maintenance activities on parallel machines,” Naval Research Logistics, vol. 47, no. 2, pp. 145–165, 2000. View at Google Scholar · View at MathSciNet
  11. M. A. Kubzin and V. A. Strusevich, “Planning machine maintenance in two-machine shop scheduling,” Operations Research, vol. 54, no. 4, pp. 789–800, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. G. Mosheiov and J. B. Sidney, “Scheduling a deteriorating maintenance activity on a single machine,” Journal of the Operational Research Society, vol. 61, no. 5, pp. 882–887, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. C. Zhao and H. Tang, “Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan,” Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 34, no. 3, pp. 837–841, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. Y. Ma, C. B. Chu, and C. R. Zuo, “A survey of scheduling with deterministic machine availability constraints,” Computers and Industrial Engineering, vol. 58, no. 2, pp. 199–211, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. G. Mosheiov and D. Oron, “Due-date assignment and maintenance activity scheduling problem,” Mathematical and Computer Modelling, vol. 44, no. 11-12, pp. 1053–1057, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  16. X. Y. Wang and M. Z. Wang, “Single machine common flow allowance scheduling with a rate-modifying activity,” Computers & Industrial Engineering, vol. 59, no. 4, pp. 898–902, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. S. J. Yang, C. J. Hsu, and D. L. Yang, “Single-machine scheduling with due-date assignment and aging effect under a deteriorating maintenance activity consideration,” International Journal of Information and Management Sciences, vol. 21, no. 2, pp. 177–195, 2010. View at Google Scholar · View at MathSciNet · View at Scopus
  18. Y. Q. Yin, T. C. E. Cheng, D. H. Xu, and C. C. Wu, “Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost,” Computers and Industrial Engineering, vol. 63, no. 1, pp. 223–234, 2012. View at Publisher · View at Google Scholar · View at Scopus
  19. L. Tang, P. B. Luh, J. Liu, and L. Fang, “Steel-making process scheduling using Lagrangian relaxation,” International Journal of Production Research, vol. 40, no. 1, pp. 55–70, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  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 · View at Scopus
  21. S. S. Panwalkar, M. L. Smith, and A. Seidmann, “Common due-date assignment to minimize total penalty for the one machine scheduling problem,” Operations Research, vol. 30, pp. 391–399, 1982. View at Google Scholar