Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration

REFERENCES

• Alidaee, B. and Womer, N. K. (1999), “Scheduling with time dependent processing times: Review and extensions”, Journal of the Operational Research Society, 50: 711–720.
   Web of Science ®Google Scholar
• Bachman, A. and Janiak, A. (2004), “Scheduling jobs with position-dependent processing times”, Journal of the Operational Research Society, 55: 257–264.
   Web of Science ®Google Scholar
• Biskup, D. (1999), “Single-machine scheduling with learning considerations”, European Journal of Operational Research, 115: 173–178.
   Web of Science ®Google Scholar
• Biskup, D. (2008), “A state-of-the-art review on scheduling with learning effects”, European Journal of Operational Research, 188: 315–329.
   Web of Science ®Google Scholar
• Brucker, P. (2001), Scheduling Algorithms, Springer-Verlag Inc., New York.
   Google Scholar
• Chen, W. J. (2006), “Minimizing total flow time in the single-machine scheduling problem with periodic maintenance”, Journal of the Operational Research Society, 57: 410–415.
   Web of Science ®Google Scholar
• Cheng, T. C. E., Ding, Q., and Lin, B. M. T. (2004), “A concise survey of scheduling with time-dependent processing times”, European Journal of Operational Research, 152: 1–13.
   Web of Science ®Google Scholar
• Cheng, T. C. E., Wu, C. C., and Lee, W. C. (2008), “Some scheduling problems with deteriorating jobs and learning effects”, Computers & Industrial Engineering, 54: 972–982.
   Web of Science ®Google Scholar
• Cheng, T. C. E., Lai, P.-J., Wu, C.-C., and Lee, W.-C. (2009), “Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations”, Information Sciences, 179: 3127–3135.
   Web of Science ®Google Scholar
• Gawiejnowicz, S. (2008), Time-dependent Scheduling, SpringerVerlag Inc., New York.
   Google Scholar
• Gawiejnowicz, S. and Kononov, A. (2010), “Complexity and approximability of scheduling resumable proportionally deteriorating jobs”, European Journal of Operational Research, 200: 305–308.
   Web of Science ®Google Scholar
• Gordon, V. S., Potts, C. N., Strusevich, V. A., and Whitehead, J. D. (2008), “Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation”, Journal of Scheduling, 11: 357–370.
   Web of Science ®Google Scholar
• Gordon, V. S. and Strusevich, V. A. (2009), “Single machine scheduling and due date assignment with positionally dependent processing times”, European Journal of Operational Research, 198: 57–62.
   Web of Science ®Google Scholar
• Gordon, V. S. and Tarasevich, A. A. (2009), “A note: common due date assignment for a single machine scheduling with the rate-modifying activity”, Computers & Operations Research, 36: 325–328.
   Web of Science ®Google Scholar
• Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G. (1979), “Optimization and approximation in deterministic sequencing and scheduling: a survey”, Annals of Discrete Mathematics, 5: 287–326.
   Google Scholar
• Gupta, J. N. D. and Gupta, S. K. (1988), “Single facility scheduling with nonlinear processing times”, Computers & Industrial Engineering, 14: 387–393.
   Web of Science ®Google Scholar
• Hardy, G. H., Littlewood, J. E., and Polya, G. (1967), Inequalities, Cambridge University Press, London.
   Google Scholar
• Inderfurth, K., Janiak, A., Kovalyov, M. Y., and Werner, F. (2006), “Batching work and rework processes with limited deterioration of reworkables”, Computers & Operations Research, 33: 1595–1605.
   Web of Science ®Google Scholar
• Janiak, A. and Kovalyov, M. Y. (2006a), “Scheduling deteriorating jobs”, in Janiak, A. (ed), Scheduling in Computer and Manufacturing Systems, Warszawa, WKL, Poland, pp. 12–25.
   Google Scholar
• Janiak, A. and Kovalyov, M. Y. (2006b), “Job sequencing with exponential functions of processing times”, Informatica, 17: 13–24.
   Web of Science ®Google Scholar
• Janiak, A. and Rudek, R. (2006), “Scheduling problems with position dependent job processing times”, in Janiak, A. (ed), Scheduling in Computer and Manufacturing Systems, Warszawa, WKL, Poland, pp. 26–38.
   Google Scholar
• Janiak, A. and Rudek, R. (2007), “The learning effect: Getting to the core of the problem”, Information Processing Letters, 103: 183–187.
   Web of Science ®Google Scholar
• Janiak, A. and Rudek, R. (2008a), “Viewpoint on: Complexity results for single-machine scheduling with positional learning effects”, Journal of the Operational Research Society, 59: 1430.
   Web of Science ®Google Scholar
• Janiak, A. and Rudek, R. (2008b), “A new approach to the learning effect: Beyond the learning curve restrictions”, Computers & Operations Research, 35: 3727–3736.
   Web of Science ®Google Scholar
• Janiak, A. and Rudek, R. (2009), “Experience based approach to scheduling problems with the learning effect”, IEEE Transactions on Systems, Man, and Cybernetics-Part A 39: 344–357.
   Web of Science ®Google Scholar
• Janiak, A. and Rudek, R. (2010a), “Scheduling jobs under an aging effect”, Journal of the Operational Research Society, 61: 1041–1048.
   Web of Science ®Google Scholar
• Janiak, A. and Rudek, R. (2010b), “A note on a makespan minimization problem with a multiabilities learning effect”, Omega, 38: 213–217.
   Web of Science ®Google Scholar
• Janiak, A., Janiak, W., Rudek, R., and Wielgus, A. (2009), “Solution algorithms for the makespan minimization problem with the general learning model”, Computers & Industrial Engineering, 56: 1301–1308.
   Web of Science ®Google Scholar
• Ji, M., He, Y., and Cheng, T. C. E. (2006), “Scheduling linear deteriorating jobs with an availability constraint on a single machine”, Theoretical Computer Science, 362: 115–126.
   Web of Science ®Google Scholar
• Ji, M., He, Y., and Cheng, T. C. E. (2007), “Single-machine scheduling with periodic maintenance to minimize makespan”, Computers & Operations Research, 34: 1764–1770.
   Web of Science ®Google Scholar
• Kubzin, M.A. and Strusevich, V.A. (2005), “Two-machine flow shop no-wait scheduling with machine maintenance”, 4OR, 3: 303–313.
   Google Scholar
• Kubzin, M. A. and Strusevich, V. A. (2006), “Planning machine maintenance in two-machine shop scheduling”, Operations Research, 54: 789–800.
   Web of Science ®Google Scholar
• Kuo, W.-H. and Yang, D.-L. (2008), “Minimizing the makespan in a single machine scheduling problem with the cyclic process of an aging effect”, Journal of the Operational Research Society, 59: 416–420.
   Web of Science ®Google Scholar
• Kuo, W.-H. and Yang, D.-L. (2010), “Some scheduling problems with deteriorating jobs and learning effects”, Computers & Industrial Engineering, 58: 25–28.
   Web of Science ®Google Scholar
• Lee, W.-C. and Wu, C.-C. (2008), “Multi-machine scheduling with deteriorating jobs and scheduled maintenance”, Applied Mathematical Modelling, 32: 362–373.
   Web of Science ®Google Scholar
• Lin, B.M.T. (2007), “Complexity results for single-machine scheduling with positional learning effects”, Journal of the Operational Research Society, 58: 1099–1102.
   Web of Science ®Google Scholar
• Low, C., Hsu, C.-J., and Su, C.-T. (2008), “Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration”, Computers and Mathematics with Applications, 56: 257–265.
   Web of Science ®Google Scholar
• Low, C., Ji, M., Hsu, C.-J., and Su, C.-T. (2010), “Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance”, Applied Mathematical Modelling, 24: 334–342.
   Web of Science ®Google Scholar
• Ma, Y., Chu, C., and Zuo, C. (2010), “A survey of scheduling with deterministic machine availability constraints”, Computers & Industrial Engineering, 58: 199–211.
   Web of Science ®Google Scholar
• Mosheiov, G. (1996), “A-shape policies for schedule deteriorating jobs”, Journal of the Operational Research Society, 47: 1184–1191.
   Web of Science ®Google Scholar
• Mosheiov, G. (2005), “A note on scheduling deteriorating jobs”, Mathematical and Computer Modelling, 41: 883–886.
   Web of Science ®Google Scholar
• Mosheiov, G. and Oron, D. (2006), “Due-date assignment and maintenance activity scheduling problem”, Mathematical and Computer Modelling, 44: 1053–1057.
   Web of Science ®Google Scholar
• Ng, C. T., Cheng, T. C. E., Bachman, A., and Janiak, A. (2002), “Three scheduling problems with deteriorating jobs to minimize the total completion time”, Information Processing Letters, 81: 327–333.
   Web of Science ®Google Scholar
• Papadimitriou, C. H. and Steiglitz, K. (1982), Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs.
   Google Scholar
• Sanlaville, E. and Schmidt, G. (1998), “Machine scheduling with availability constraints”, Acta Informatica, 9: 795–811.
   Web of Science ®Google Scholar
• Schmidt, G. (2000), “Scheduling with limited machine availability”, European Journal of Operational Research, 121: 1–15.
   Web of Science ®Google Scholar
• Wu, C.-C. and Lee, W.-C. (2003), “Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine”, Information Processing Letters, 87: 89–93.
   Web of Science ®Google Scholar
• Zhao, C.-L. and Tang, H.-Y. (2010), “Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan”, Applied Mathematical Modelling, 34: 837–841.
   Web of Science ®Google Scholar