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

A Note on a Fully Polynomial-Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

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

Received 12 June 2013; Accepted 9 August 2013

Academic Editor: Yunqiang Yin

Copyright © 2013 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. S. Browne and U. Yechiali, “Scheduling deteriorating jobs on a single processor,” Operations Research, vol. 38, no. 3, pp. 495–498, 1990. View at Google Scholar · 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 Google Scholar · View at Scopus
  4. Z.-L. Chen, “Parallel machine scheduling with time dependent processing times,” Discrete Applied Mathematics, vol. 70, no. 1, pp. 81–93, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. M. Ji and T. C. E. Cheng, “Parallel-machine scheduling of simple linear deteriorating jobs,” Theoretical Computer Science, vol. 410, no. 38–40, pp. 3761–3768, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. C.-C. Wu and W.-C. Lee, “Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine,” Information Processing Letters, vol. 87, no. 2, pp. 89–93, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. B. Fan, S. Li, L. Zhou, and L. Zhang, “Scheduling resumable deteriorating jobs on a single machine with non-availability constraints,” Theoretical Computer Science, vol. 412, no. 4-5, pp. 275–280, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. M. Ji, Y. He, and T. C. E. Cheng, “Scheduling linear deteriorating jobs with an availability constraint on a single machine,” Theoretical Computer Science, vol. 362, no. 1–3, pp. 115–126, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. S. S. Li and B. Q. Fan, “Single-Machine scheduling with proportionally deteriorating jobs subject to availability Constraints,” Asia-Pacific Journal of Operational Research, vol. 29, no. 4, 10 pages, 2012. View at Publisher · View at Google Scholar
  10. 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 Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. 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 Google Scholar · View at Scopus
  12. W. E. Smith, “Various optimizers for single-stage production,” Naval Research Logistics Quarterly, vol. 3, no. 1-2, pp. 59–66, 1956. View at Publisher · View at Google Scholar · View at MathSciNet