Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 270942, 7 pages
http://dx.doi.org/10.1155/2014/270942
Research Article

Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection

1School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong 273165, China
2School of Management Sciences, Qufu Normal University, Rizhao, Shandong 276826, China

Received 12 March 2014; Accepted 1 July 2014; Published 21 July 2014

Academic Editor: Bahman Naderi

Copyright © 2014 Juan Zou and 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. C. 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 Zentralblatt MATH · 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. T. C. E. Cheng, Z.-H. Liu, and W.-C. Yu, “Scheduling jobs with release dates and deadlines on a batch processing machine,” IIE Transactions, vol. 33, no. 8, pp. 685–690, 2001. View at Publisher · View at Google Scholar · View at Scopus
  4. X. Deng, C. K. Poon, and Y. Zhang, “Approximation algorithms in batch processing,” in Algorithms and Computation (Chennai, 1999), vol. 1741 of Lecture Notes on Computer Science, pp. 153–162, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  5. X. Deng and Y. Z. Zhang, “Minimizing mean response time for batch processing systems,” in Computing and Combinatorics, vol. 1627 of Lecture Notes on Computer Science, pp. 231–240, 1999. View at Publisher · View at Google Scholar
  6. Z. Liu and W. Yu, “Scheduling one batch processor subject to job release dates,” Discrete Applied Mathematics, vol. 105, no. 1–3, pp. 129–136, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. Z. H. Liu, J. J. Yuan, and T. C. E. Cheng, “On scheduling an unbounded batch machine,” Operations Research Letters, vol. 31, no. 1, pp. 42–48, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. P. Brucker and S. Knust, Complexity Results for Scheduling Problems, 2009, http://www.informatik.uni-osnabrueck.de/knust/class/.
  9. 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
  10. 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
  11. B. Alidaee and N. K. Womer, “Scheduling with time dependent processing times: review and extensions,” Journal of the Operational Research Society, vol. 50, no. 7, pp. 711–720, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. 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
  13. S. Li, C. T. Ng, T. C. E. Cheng, and 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. C. X. Miao, Y. Z. Zhang, and C. L. Wu, “Scheduling of deteriorating jobs with release dates to minimize the maximum lateness,” Theoretical Computer Science, vol. 462, pp. 80–87, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J. Zou, Y. Z. Zhang, and C. X. Miao, “Uniform parallel-machine scheduling with time dependent processing times,” Journal of Operations Research Society of China, vol. 1, pp. 239–252, 2013. View at Publisher · View at Google Scholar
  16. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. 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
  17. H. Hoogeveen, M. Skutella, and G. J. Woeginger, “Preemptive scheduling with rejection,” Mathematical Programming. A Publication of the Mathematical Programming Society, vol. 94, no. 2-3, Ser. B, pp. 361–374, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. 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
  19. D. W. Engels, D. R. Karger, S. G. Kolliopoulos, S. Sengupta, R. N. Uma, and J. Wein, “Techniques for scheduling with rejection,” Journal of Algorithms, vol. 49, no. 1, pp. 175–191, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. D. Shabtay, N. Gaspar, and M. Kaspi, “A survey on offline scheduling with rejection,” Journal of Scheduling, vol. 16, no. 1, pp. 3–28, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  22. S. Li and J. Yuan, “Parallel-machine scheduling with deteriorating jobs and rejection,” Theoretical Computer Science, vol. 411, no. 40–42, pp. 3642–3650, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  24. S. Gawiejnowicz, Time-Dependent Scheduling, Monographs in Theoretical Computer Science. An EATCS Series, Springer, Berlin, Germany, 2008. View at MathSciNet
  25. S. Sengupta, “Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection,” in Algorithms and Data Structures, vol. 2748 of Lecture Notes in Computer Science, pp. 79–90, 2003. View at Publisher · View at Google Scholar