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

Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

College of Science, East China Institute of Technology, Nanchang, Jiangxi 330013, China

Received 31 August 2014; Accepted 15 September 2014

Academic Editor: Chin-Chia Wu

Copyright © 2015 Ting Wang and Dehua Xu. 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. J. R. Jackson, “Scheduling a production line to minimize maximum tardiness,” Research Report 43, Management Science Research Project, University of California, Los Angeles, Calif, USA, 1955. View at Google Scholar
  2. R. Rudek, “The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect,” Applied Mathematics and Computation, vol. 218, no. 11, pp. 6498–6510, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. Z. Jiang, F. Chen, and C. Wu, “Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect,” Applied Mathematics and Computation, vol. 218, no. 18, pp. 9438–9441, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. N. Vakhania and F. Werner, “Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time,” Theoretical Computer Science, vol. 501, pp. 72–81, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. T. Chen, “An effective dispatching rule for bi-objective job scheduling in a wafer fabrication factory-considering the average cycle time and the maximum lateness,” International Journal of Advanced Manufacturing Technology, vol. 67, no. 5-8, pp. 1281–1295, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. V. Sels and M. Vanhoucke, “A hybrid electromagnetism-like mechanism/tabu search procedure for the single machine scheduling problem with a maximum lateness objective,” Computers & Industrial Engineering, vol. 67, no. 1, pp. 44–55, 2014. View at Publisher · View at Google Scholar · View at Scopus
  7. Z. Liu and Y. K. Ro, “Rescheduling for machine disruption to minimize makespan and maximum lateness,” Journal of Scheduling, vol. 17, no. 4, pp. 339–352, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. M. Ji, Y. He, and T. C. E. Cheng, “Single-machine scheduling with periodic maintenance to minimize makespan,” Computers and Operations Research, vol. 34, no. 6, pp. 1764–1770, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. H.-T. Lee, D.-L. Yang, and S.-J. Yang, “Multi-machine scheduling with deterioration effects and maintenance activities for minimizing the total earliness and tardiness costs,” International Journal of Advanced Manufacturing Technology, vol. 66, no. 1–4, pp. 547–554, 2013. View at Publisher · View at Google Scholar · View at Scopus
  10. D. Xu and D.-L. Yang, “Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies,” Applied Mathematical Modelling, vol. 37, no. 14-15, pp. 7561–7567, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. D. Xu, A. Liu, and D. L. Yang, “Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities,” Arabian Journal for Science and Engineering, vol. 39, no. 5, pp. 3715–3722, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. Y. Yin, D. Ye, and G. Zhang, “Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval,” Information Sciences, vol. 274, pp. 310–322, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. S.-J. Yang, C.-J. Hsu, and D.-L. Yang, “Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance,” Optimization Letters, vol. 6, no. 8, pp. 1855–1873, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. T. C. E. Cheng, S. J. Yang, and D. L. Yang, “Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity,” International Journal of Production Economics, vol. 135, no. 1, pp. 154–161, 2012. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. Yin, W.-H. Wu, T. C. E. Cheng, and C.-C. Wu, “Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities,” International Journal of Production Research, vol. 52, no. 8, pp. 2311–2326, 2014. View at Publisher · View at Google Scholar · View at Scopus
  16. W. Luo, L. Chen, and G. Zhang, “Approximation algorithms for scheduling with a variable machine maintenance,” in Algorithmic Aspects in Information and Management, vol. 6124 of Lecture Notes in Computer Science, pp. 209–219, 2010. View at Publisher · View at Google Scholar
  17. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, Springer, New York, NY, USA, 4th edition, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  18. M. R. Garey and D. S. Johnson, Computers and Intractrability: A Guide to the Theory of NP-Completeness, Freeman, New York, NY, USA, 1979.