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

Parallel-Machine Scheduling with Time-Dependent and Machine Availability Constraints

School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong 273165, China

Received 9 February 2015; Revised 11 April 2015; Accepted 12 April 2015

Academic Editor: Chin-Chia Wu

Copyright © 2015 Cuixia Miao and Juan Zou. 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. Gawiejnowicz, Time-Dependent Scheduling, vol. 18 of Monographs in Theoretical Computer Science. An EATCS Series, Springer, Berlin, Germany, 2008. View at MathSciNet
  2. J. N. D. Gupta and S. K. Gupta, “Single facility scheduling with nonlinear processing times,” Computers and Industrial Engineering, vol. 14, no. 4, pp. 387–393, 1988. View at Publisher · View at Google Scholar · View at Scopus
  3. 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
  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 MathSciNet · View at Scopus
  5. G. H. Graves and C.-Y. Lee, “Scheduling maintenance and semiresumable jobs on a single machine,” Naval Research Logistics, vol. 46, no. 7, pp. 845–863, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  6. C.-Y. 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
  7. 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
  8. 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 · View at Scopus
  9. 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 MathSciNet · View at Scopus
  10. S. Gawiejnowicz and A. Kononov, “Complexity and approximability of scheduling resumable proportionally deteriorating jobs,” European Journal of Operational Research, vol. 200, no. 1, pp. 305–308, 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. B. Fan, S. S. Li, L. Zhou, and L. Q. 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 MathSciNet · View at Scopus
  12. 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, Article ID 1250019, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. M. Ji and T. C. 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 MathSciNet · View at Scopus
  14. M. Liu, F. F. Zheng, S. J. Wang, and Y. F. Xu, “Approximation algorithms for parallel machine scheduling with linear deterioration,” Theoretical Computer Science, vol. 497, pp. 108–111, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. G. J. Woeginger, “When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?” INFORMS Journal on Computing, vol. 12, no. 1, pp. 57–74, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus