Table of Contents
Journal of Industrial Engineering
Volume 2014 (2014), Article ID 568317, 13 pages
http://dx.doi.org/10.1155/2014/568317
Research Article

Minimizing the Number of Tardy Jobs on a Single Machine with an Availability Constraint

1Industrial Management Group, Binaloud Institute of Higher Education, Mashhad 9351991949, Iran
2Department of Industrial Engineering, Isfahan University of Technology, Isfahan 8415683111, Iran

Received 10 May 2014; Accepted 19 August 2014; Published 1 September 2014

Academic Editor: Purushothaman Damodaran

Copyright © 2014 Ehsan Molaee and Ghasem Moslehi. 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. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall, New Jersey, NJ, USA, 2002. View at MathSciNet
  2. 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 · View at Scopus
  3. J. B. Sidney, “An extension of Moore's due date algorithm,” in Symposium on the Theory of Scheduling and Its Applications, S. E. Elmaghrebi, Ed., Lecture Notes in Economics and Mathematical Systems, pp. 393–398, Springer, New York, NY, USA, 1973. View at Publisher · View at Google Scholar · View at MathSciNet
  4. I. Adiri, J. Bruno, E. Frostig, and A. H. G. Rinnooy Kan, “Single machine flow-time scheduling with a single breakdown,” Acta Informatica, vol. 26, no. 7, pp. 679–696, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. C. Y. Lee and S. D. Liman, “Single machine flow-time scheduling with scheduled maintenance,” Acta Informatica, vol. 29, no. 4, pp. 375–382, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. C. Sadfi, B. Penz, C. Rapine, J. Blazewicz, and P. Formanowicz, “An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints,” European Journal of Operational Research, vol. 161, no. 1, pp. 3–10, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. J. Breit, “Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint,” European Journal of Operational Research, vol. 183, no. 2, pp. 516–524, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  8. I. Kacem and C. Chu, “Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint,” International Journal of Production Economics, vol. 112, no. 1, pp. 138–150, 2008. View at Publisher · View at Google Scholar · View at Scopus
  9. I. Kacem, “Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval,” Computers & Industrial Engineering, vol. 54, no. 3, pp. 401–410, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. I. Kacem, C. Chu, and A. Souissi, “Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times,” Computers & Operations Research, vol. 35, no. 3, pp. 827–844, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. C. J. Liao and W. J. Chen, “Single-machine scheduling with periodic maintenance and nonresumable jobs,” Computers and Operations Research, vol. 30, no. 9, pp. 1335–1347, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. M. Ji, Y. He, and T. C. E. Cheng, “Single-machine scheduling with periodic maintenance to minimize makespan,” Computers and Operations Research, vol. 34, no. 6, pp. 1764–1770, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. W.-J. Chen, “An efficient algorithm for scheduling jobs on a machine with periodic maintenance,” International Journal of Advanced Manufacturing Technology, vol. 34, no. 11-12, pp. 1173–1182, 2007. View at Publisher · View at Google Scholar · View at Scopus
  14. I. Adiri, E. Frostig, and A. H. G. Rinnooy Kan, “Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs,” Naval Research Logistics, vol. 38, no. 2, pp. 261–271, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  15. W.-J. Chen, “Minimizing number of tardy jobs on a single machine subject to periodic maintenance,” Omega, vol. 37, no. 3, pp. 591–599, 2009. View at Publisher · View at Google Scholar · View at Scopus