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

Online Scheduling with Delivery Time on a Bounded Parallel Batch Machine with Limited Restart

1School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, China
2College of Science, Henan Institute of Engineering, Zhengzhou, Henan 451191, China
3School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, China
4Accounting School, Jiangxi University of Finance and Economics, Nanchang 330013, China

Received 23 August 2014; Accepted 28 September 2014

Academic Editor: Yunqiang Yin

Copyright © 2015 Hailing Liu 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. H. Hoogeveen, C. N. Potts, and G. J. Woeginger, “On-line scheduling on a single machine: maximizing the number of early jobs,” Operations Research Letters, vol. 27, no. 5, pp. 193–197, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. M. van den Akker, H. Hoogeveen, and N. Vakhania, “Restarts can help in the on-line minimization of the maximum delivery time on a single machine,” Journal of Scheduling, vol. 3, no. 6, pp. 333–341, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. L. Epstein and R. van Stee, “Lower bounds for on-line single-machine scheduling,” Theoretical Computer Science, vol. 299, no. 1, pp. 439–450, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. R. van Stee and H. La Poutré, “Minimizing the total completion time on-line on a single machine, using restarts,” Journal of Algorithms, vol. 57, no. 2, pp. 95–129, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. J. J. Yuan, R. Y. Fu, C. T. Ng, and T. C. E. Cheng, “A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan,” Journal of Scheduling, vol. 14, no. 4, pp. 361–369, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. R. Fu, J. Tian, J. Yuan, and C. He, “On-line scheduling on a batch machine to minimize makespan with limited restarts,” Operations Research Letters, vol. 36, no. 2, pp. 255–258, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. R. Uzsoy, C. Y. Lee, and L. A. Martin-Vega, “A review of production planning and scheduling models in the semiconductor industry, part I: system characteristics, performance evaluation and production planning,” IIE Transaction on Scheduling and Logistics, vol. 26, no. 5, pp. 47–61, 1994. View at Google Scholar · View at Scopus
  8. R. Uzsoy, C.-Y. Lee, and L. A. Martin-Vega, “Review of production planning and scheduling models in the semiconductor industry part II: shop-floor control,” IIE Transaction on Scheduling and Logistics, vol. 26, no. 5, pp. 44–55, 1994. View at Google Scholar · View at Scopus
  9. X. Deng, C. K. Poon, and Y. Zhang, “Approximation algorithms in batch processing,” Journal of Combinatorial Optimization, vol. 7, no. 3, pp. 247–257, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. G. Zhang, X. Cai, and C. K. Wong, “On-line algorithms for minimizing makespan on batch processing machines,” Naval Research Logistics, vol. 48, no. 3, pp. 241–258, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. C. K. Poon and W. Yu, “On-line scheduling algorithms for a batch machine with finite capacity,” Journal of Combinatorial Optimization, vol. 9, no. 2, pp. 167–186, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. P. Liu, X. Lu, and Y. Fang, “A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines,” Journal of Scheduling, vol. 15, no. 1, pp. 77–81, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. J. Tian, T. C. Cheng, C. T. Ng, and J. Yuan, “Online scheduling on unbounded parallel-batch machines to minimize the makespan,” Information Processing Letters, vol. 109, no. 21-22, pp. 1211–1215, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. J. Tian, R. Y. Fu, and J. J. Yuan, “On-line scheduling with delivery time on a single batch machine,” Theoretical Computer Science, vol. 374, no. 1–3, pp. 49–57, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J. J. Yuan, 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
  16. Y. Fang, P. H. Liu, and X. W. Lu, “Optimal on-line algorithms for one batch machine with grouped processing times,” Journal of Combinatorial Optimization, vol. 22, no. 4, pp. 509–516, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. J. Tian, T. C. Cheng, C. T. Ng, and J. Yuan, “An improved on-line algorithm for single parallel-batch machine scheduling with delivery times,” Discrete Applied Mathematics, vol. 160, no. 7-8, pp. 1191–1210, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. P. Liu and X. Lu, “Online unbounded batch scheduling on parallel machines with delivery times,” Journal of Combinatorial Optimization, 2014. View at Publisher · View at Google Scholar · View at Scopus
  19. R. Y. Fu, T. Ji, J. J. Yuan, and Y. X. Lin, “Online scheduling in a parallel batch processing system to minimize makespan using restarts,” Theoretical Computer Science, vol. 374, no. 1–3, pp. 196–202, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. R. Fu, T. C. Cheng, C. T. Ng, and J. Yuan, “Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan,” Information Processing Letters, vol. 110, no. 11, pp. 444–450, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. H. Liu and J. Yuan, “Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart,” Theoretical Computer Science, vol. 543, pp. 24–36, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet