Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016 (2016), Article ID 6124734, 12 pages
http://dx.doi.org/10.1155/2016/6124734
Research Article

Minimizing Total Earliness and Tardiness for Common Due Date Single-Machine Scheduling with an Unavailability Interval

1Department of Industrial Engineering and Management, National Yunlin University of Science and Technology, 123 University Road, Douliou, Yunlin 64002, Taiwan
2Department of Industrial Engineering and Management, National Chiao Tung University, 1001 University Road, Hsinchu 30010, Taiwan

Received 23 March 2016; Accepted 6 June 2016

Academic Editor: Miguel A. Salido

Copyright © 2016 Chinyao Low 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. K. R. Baker and G. D. Scudder, “Sequencing with earliness and tardiness penalties: a review,” Operations Research, vol. 38, no. 1, pp. 22–36, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. D. Biskup and M. Feldmann, “Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates,” Computers and Operations Research, vol. 28, no. 8, pp. 787–801, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. V. Gordon, J.-M. Proth, and C. Chu, “A survey of the state-of-the-art of common due date assignment and scheduling research,” European Journal of Operational Research, vol. 139, no. 1, pp. 1–25, 2002. View at Publisher · View at Google Scholar · View at Scopus
  4. V. Lauff and F. Werner, “Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey,” Mathematical and Computer Modelling, vol. 40, no. 5-6, pp. 637–655, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. J. J. Kanet, “Minimizing the average deviation of job completion times about a common due date,” Naval Research Logistics Quarterly, vol. 28, no. 4, pp. 643–651, 1981. View at Publisher · View at Google Scholar · View at Scopus
  6. U. Bagchi, R. S. Sullivan, and Y.-L. Chang, “Minimizing mean absolute deviation of completion times about a common due date,” Naval Research Logistics Quarterly, vol. 33, no. 2, pp. 227–240, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. P. S. Sundararaghavan and M. U. Ahmed, “Minimizing the sum of absolute lateness in single-machine and multimachine scheduling,” Naval Research Logistics Quarterly, vol. 31, no. 2, pp. 325–333, 1984. View at Publisher · View at Google Scholar · View at Scopus
  8. H. Emmons, “Scheduling to a common due date on parallel uniform processors,” Naval Research Logistics, vol. 34, no. 6, pp. 803–810, 1987. View at Google Scholar · View at MathSciNet
  9. N. G. Hall, W. Kubiak, and S. P. Sethi, “Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date,” Operations Research, vol. 39, no. 5, pp. 847–856, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. J. A. Hoogeveen and S. L. van de Velde, “Scheduling around a small common due date,” European Journal of Operational Research, vol. 55, no. 2, pp. 237–242, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. J. A. Hoogeveen, H. Oosterhout, and S. L. van de Velde, “New lower and upper bounds for scheduling around a small common due date,” Operations Research, vol. 42, no. 1, pp. 102–110, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. W. Szwarc, “Single-machine scheduling to minimize absolute deviation of completion times from a common due date,” Naval Research Logistics, vol. 36, no. 5, pp. 663–673, 1989. View at Google Scholar · View at MathSciNet
  13. J. A. Ventura and M. X. Weng, “An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date,” Operations Research Letters, vol. 17, no. 3, pp. 149–152, 1995. View at Publisher · View at Google Scholar · View at Scopus
  14. H. Sarper, “Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem,” Applied Mathematical Modelling, vol. 19, no. 3, pp. 153–161, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. C. S. Sakuraba, D. P. Ronconi, and F. Sourd, “Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date,” Computers & Operations Research, vol. 36, no. 1, pp. 60–72, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. C. S. Sung and J. I. Min, “Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date,” European Journal of Operational Research, vol. 131, no. 1, pp. 95–106, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. W. K. Yeung, C. Oğuz, and T. C. E. Cheng, “Two-stage flowshop earliness and tardiness machine scheduling involving a common due window,” International Journal of Production Economics, vol. 90, no. 3, pp. 421–434, 2004. View at Publisher · View at Google Scholar · View at Scopus
  18. V. Lauff and F. Werner, “On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties,” Computers & Operations Research, vol. 31, no. 3, pp. 317–345, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. C.-Y. Lee, L. Lei, and M. Pinedo, “Current trends in deterministic scheduling,” Annals of Operations Research, vol. 70, pp. 1–41, 1997. View at Publisher · View at Google Scholar · View at Scopus
  20. G. Schmidt, “Scheduling with limited machine availability,” European Journal of Operational Research, vol. 121, no. 1, pp. 1–15, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. Y. Ma, C. Chu, and C. Zuo, “A survey of scheduling with deterministic machine availability constraints,” Computers and Industrial Engineering, vol. 58, no. 2, pp. 199–211, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. C. Low, M. Ji, C.-J. Hsu, and C.-T. Su, “Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance,” Applied Mathematical Modelling, vol. 34, no. 2, pp. 334–342, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. G. Mosheiov and J. B. Sidney, “Scheduling a deteriorating maintenance activity on a single machine,” Journal of the Operational Research Society, vol. 61, no. 5, pp. 882–887, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  24. C.-l. Zhao and H.-Y. Tang, “Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan,” Applied Mathematical Modelling, vol. 34, no. 3, pp. 837–841, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. F. Ángel-Bello, A. Álvarez, J. Pacheco, and I. Martínez, “A single machine scheduling problem with availability constraints and sequence-dependent setup costs,” Applied Mathematical Modelling, vol. 35, no. 4, pp. 2041–2050, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  26. Y. Huo and H. Zhao, “Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints,” Theoretical Computer Science, vol. 412, no. 12-14, pp. 1081–1091, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  27. S.-L. Yang, Y. Ma, D.-L. Xu, and J.-B. Yang, “Minimizing total completion time on a single machine with a flexible maintenance activity,” Computers and Operations Research, vol. 38, no. 4, pp. 755–770, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. J.-Y. Lee and Y.-D. Kim, “Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance,” Computers & Operations Research, vol. 39, no. 9, pp. 2196–2205, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. Y. Yin, T. C. E. Cheng, D. Xu, and C.-C. Wu, “Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost,” Computers and Industrial Engineering, vol. 63, no. 1, pp. 223–234, 2012. View at Publisher · View at Google Scholar · View at Scopus
  30. M. Dong, “Parallel machine scheduling with limited controllable machine availability,” International Journal of Production Research, vol. 51, no. 8, pp. 2240–2252, 2013. View at Publisher · View at Google Scholar · View at Scopus
  31. C.-J. Hsu, M. Ji, J.-Y. Guo, and D.-L. Yang, “Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities,” Information Sciences, vol. 253, pp. 163–169, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. L. Shen, D. Wang, and X.-Y. Wang, “Parallel-machine scheduling with non-simultaneous machine available time,” Applied Mathematical Modelling, vol. 37, no. 7, pp. 5227–5232, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. B. Vahedi-Nouri, P. Fattahi, M. Rohaninejad, and R. Tavakkoli-Moghaddam, “Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints,” Applied Mathematical Modelling, vol. 37, no. 5, pp. 3126–3137, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. D. Xu and D.-L. Yang, “Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies,” Applied Mathematical Modelling, vol. 37, no. 14-15, pp. 7561–7567, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  35. N. Hashemian, C. Diallo, and B. Vizvári, “Makespan minimization for parallel machines scheduling with multiple availability constraints,” Annals of Operations Research, vol. 213, no. 1, pp. 173–186, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. V. Kaplanoğlu, “Multi-agent based approach for single machine scheduling with sequence-dependent setup times and machine maintenance,” Applied Soft Computing, vol. 23, pp. 165–179, 2014. View at Publisher · View at Google Scholar · View at Scopus
  37. K. Rustogi and V. A. Strusevich, “Combining time and position dependent effects on a single machine subject to rate-modifying activities,” Omega, vol. 42, no. 1, pp. 166–178, 2014. View at Publisher · View at Google Scholar · View at Scopus
  38. Y. Yin, D. Ye, and G. Zhang, “Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval,” Information Sciences, vol. 274, pp. 310–322, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  39. Y. Yin, W.-H. Wu, T. C. E. Cheng, and C.-C. Wu, “Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities,” International Journal of Production Research, vol. 52, no. 8, pp. 2311–2326, 2014. View at Publisher · View at Google Scholar · View at Scopus
  40. K. Rustogi and V. A. Strusevich, “Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance,” Journal of the Operational Research Society, vol. 66, no. 3, pp. 500–515, 2015. View at Publisher · View at Google Scholar
  41. C. Low, R.-K. Li, G.-H. Wu, and C.-L. Huang, “Minimizing the sum of absolute deviations under a common due date for a single-machine scheduling problem with availability constraints,” Journal of Industrial and Production Engineering, vol. 32, no. 3, pp. 204–217, 2015. View at Publisher · View at Google Scholar · View at Scopus
  42. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. 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 Scopus
  43. T. C. E. Cheng and H. G. Kahlbacher, “A proof for the longest-job-first policy in one-machine scheduling,” Naval Research Logistics, vol. 38, no. 5, pp. 715–720, 1991. View at Google Scholar · View at MathSciNet
  44. 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 MathSciNet · View at Scopus