Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 6093029, 5 pages
https://doi.org/10.1155/2017/6093029
Research Article

Batch Scheduling with Proportional-Linear Deterioration and Outsourcing

1School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong 273165, China
2School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China
3Caoxian No. 1 Middle School, Heze, Shandong 274400, China

Correspondence should be addressed to Cuixia Miao; moc.621@aixiucoaim

Received 10 March 2017; Accepted 23 April 2017; Published 22 June 2017

Academic Editor: Marco Pizzarelli

Copyright © 2017 Cuixia Miao et al. 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. C.-Y. Lee, R. Uzsoy, and L. A. Martin-Vega, “Efficient algorithms for scheduling semiconductor burn-in operations,” Operations Research, vol. 40, no. 4, pp. 764–775, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  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 Publisher · 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 MathSciNet · View at Scopus
  4. Y. Z. Zhang and Z. G. Cao, “Parallel batch scheduling: a survey,” Advances in Mathematics (China). Shuxue Jinzhan, vol. 37, no. 4, pp. 392–408, 2008. View at Google Scholar · View at MathSciNet
  5. 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
  6. 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
  7. S. Gawiejnowicz, Time-Dependent Scheduling, Monographs in Theoretical Computer Science. An EATCS Series, Springer, Berlin, Germany, 2008. View at MathSciNet
  8. 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
  9. 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
  10. C. Miao, “Parallel-batch scheduling with two models of deterioration to minimize the makespan,” Abstract and Applied Analysis, vol. 2014, Article ID 495187, 10 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  11. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. r. Sgall, and L. Stougie, “Multiprocessor scheduling with rejection,” SIAM Journal on Discrete Mathematics, vol. 13, no. 1, pp. 64–78, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. Z. Cao and X. Yang, “A {PTAS} for parallel batch scheduling with rejection and dynamic job arrivals,” Theoretical Computer Science, vol. 410, no. 27-29, pp. 2732–2745, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. L. Lu, L. Zhang, and J. Yuan, “The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan,” Theoretical Computer Science, vol. 396, no. 1-3, pp. 283–289, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. L. Lu, T. C. Cheng, J. Yuan, and L. Zhang, “Bounded single-machine parallel-batch scheduling with release dates and rejection,” Computers & Operations Research, vol. 36, no. 10, pp. 2748–2751, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  15. Y. Cheng and S. Sun, “Scheduling linear deteriorating jobs with rejection on a single machine,” European Journal of Operational Research, vol. 194, no. 1, pp. 18–27, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. C. X. Miao, Some problems of the batch scheduling and scheduling with availability constraints, Qufu Normal University, Jining, China, 2011.
  17. G. Mosheiov, “Scheduling jobs under simple linear deterioration,” Computers & Operations Research, vol. 21, no. 6, pp. 653–659, 1994. View at Publisher · View at Google Scholar · View at Scopus
  18. C. Miao, Y. Zhang, and Z. Cao, “Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs,” Information Processing Letters, vol. 111, no. 16, pp. 798–803, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. Y. Z. Zhang and C. X. Miao, “Copy method and its applications to batching scheduling problems,” Journal of Qufu Normal University, vol. 30, no. 2, pp. 41–43, 2004 (Chinese). View at Google Scholar · View at MathSciNet