Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2014, Article ID 495187, 10 pages
http://dx.doi.org/10.1155/2014/495187
Research Article

Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan

1School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong 273165, China
2School of Physics and Engineering, Qufu Normal University, Qufu, Shandong 273165, China

Received 8 April 2014; Accepted 21 June 2014; Published 23 July 2014

Academic Editor: Fabio M. Camilli

Copyright © 2014 Cuixia Miao. 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.
  2. P. Brucker, A. Gladky, H. Hoogeveen et al., “Scheduling a batching machine,” Journal of Scheduling, vol. 1, no. 1, pp. 31–54, 1998. View at Google Scholar · View at MathSciNet · View at Scopus
  3. C. N. Potts and M. Y. Kovalyov, “Scheduling with batching: a review,” European Journal of Operational Research, vol. 120, no. 2, pp. 228–249, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. Y. Z. Zhang and Z. G. Cao, “Parallel batch scheduling: a survey,” Advances in Mathematics, vol. 37, pp. 392–408, 2008 (Chinese). View at Google Scholar
  5. J. J. Yuan, S. S. Li, J. Tian, and R. Y. Fu, “A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times,” Journal of Combinatorial Optimization, vol. 17, no. 2, pp. 206–213, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. 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
  7. 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 Scopus
  8. 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 · View at Scopus
  9. M. Ji and T. C. E. Cheng, “Parallel-machine scheduling with simple linear deterioration to minimize total completion time,” European Journal of Operational Research, vol. 188, no. 2, pp. 342–347, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. 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 MathSciNet · View at Scopus
  11. M. Liu, F. Zheng, C. Chu, and J. Zhang, “An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration,” Journal of Combinatorial Optimization, vol. 23, no. 4, pp. 483–492, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. X. Qi, S. Zhou, and J. Yuan, “Single machine parallel-batch scheduling with deteriorating jobs,” Theoretical Computer Science, vol. 410, no. 8–10, pp. 830–836, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. S.-S. Li, C. T. Ng, T. C. E. Cheng, and J.-J. Yuan, “Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan,” European Journal of Operational Research, vol. 210, no. 3, pp. 482–488, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. C. X. Miao, Z. Y. Zhang, and Z. G. Cao, “Parallel-batch scheduling of deteriorating jobs with release date to minimize the makespan,” Information Processing Letters, vol. 111, no. 16, pp. 798–803, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. 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 Publisher · View at Google Scholar · View at Scopus