Early Tardy Minimization for Joint Scheduling of Jobs and Maintenance Operations on a Single Machine (original) (raw)

2007, International Journal of Operations …

Abstract

Abstract¾In this paper, we consider joint scheduling of jobs and preventive maintenance operations on a single machine with an objective to minimize the total earliness and tardiness of jobs about a common due date. The properties of an optimal schedule are identified and utilized to develop a constructive heuristic and a lower bound estimate. The properties are also utilized to hybridize Tabu search and Simulated Annealing algorithms. A numerical study with over 3200 randomly generated problems is reported to demonstrate the performance of the proposed solution methods. The study shows that the effectiveness of the proposed lower bound and constructive heuristic is sensitive to maintenance related parameters. We also show that hybridized Tabu search and Simulated Annealing algorithms are efficient approaches to solve the problem.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (27)

  1. Adzakpa, K.P., Adjallah, K.H., and Lee, J. (2004). A new effective heuristic for the intelligent management of the preventive maintenance tasks of the distributed systems. Advanced Engineering Informatics, 17: 151-163.
  2. Adzakpa, K.P., Adjallah, K.H., and Yalaoui, F. (2004). Scheduling with tool changes to minimize total completion time: Basic results and spt performance. Journal of Intelligent Manufacturing, 15: 131-140.
  3. Aggoune, R. (2004). Minimizing the makespan for the flow shop scheduling problem with availability constraints. European Journal of Operational Research, 153: 534-543.
  4. Akturk, M.S., Ghosh, J.B., and Gunes, E.D. (2003). Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance. Naval Research Logistics, 50: 15-30.
  5. Bulbul, K., Kaminsky, P., and Yano, C. (2004). Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs. Naval Research Logistics, 51: 407-445.
  6. Cassady, C.R. and Kutanoglu, E. (2003). Minimizing job tardiness using integrated preventive maintenance planning and production scheduling. IIE Transactions, 35: 503-513.
  7. Chen, Z.L. (2004). Simultaneous job scheduling and resource allocation on parallel machines. Annals of Operations Research, 129: 135-153.
  8. Chen, Z.L. and Powell, W.B. (2003). Exact algorithms for scheduling multiple families of jobs on parallel machines. Naval Research Logistics, 50: 823-840.
  9. Eglese, R.W. (1990). Simulated annealing: A tool for operational research. European Journal of Operational Research, 46: 271-281.
  10. Eilon, S. and Chowdhury, I.G. (1977). Minimizing waiting time variance in the single machine problem. Management Science, 23: 567-575.
  11. Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 5: 533-549.
  12. Glover, F. and Laguna, M. (1997). Tabu Search, Kluwer Academic Publishers.
  13. Kanet, J.J. (1981). Minimizing the average deviation of the job completion times about a common due date. Naval Research Logistics, 28: 643-651.
  14. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P. (1983). Optimization by simulated annealing. Management Science, 220: 671-680.
  15. Lee, C.Y. and Chen, Z. (2000). Scheduling jobs and maintenance activities on parallel machine. Naval Research Logistics, 47: 145-165.
  16. Liao, C.J., Shyur, D.L., and Lin, C.H. (2005). Makespan minimization for two parallel machines with an availability constraint. European Journal of Operational Research, 160: 445-456.
  17. Lorigeon, T., Billaut, J.C., and Bouquard, J.L. (2002). A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint. Journal of the Operational Research Society, 53: 1239-1246.
  18. Lyu, J., Gunasekaran, A. and Ding, J.H. (1996). Simulated annealing algorithm for solving the single machine early/tardy problem. International Journal of Systems Science, 27: 605-610.
  19. Mazzini, R. and Armentano, V. A. (2001). A heuristic for single machine scheduling with early and tardy costs. European Journal of Operational Research, 128: 129-146.
  20. Merten, A.G. and Muller, M.E. (1972). Variance minimization in single machine sequencing problems. Management Science, 18: 512-528.
  21. Qi, X., Chen, T., and Tu, F. (1999). Scheduling the maintenance on a single machine. Journal of the Operational Research Society, 50: 1071-1078.
  22. Raza, S.A. (2002). Simultaneous Maintenance and Jobs Scheduling on Single Machine under Various Maintenance Policies, Master's thesis, King Fahd University of Petroleum and Minerals, Saudi Arabia.
  23. Sait, S.M. and Youssef, H. (1999). Iterative Computer Algorithms with Applications in Engineering, IEEE Computer Society.
  24. Schrage, L. (1975). Minimizing the time-in-system variance for a finite jobset. Management Science, 21: 540-543.
  25. Sortrakul, N., Nachtmann, H., and Cassady, C.R. (2005). Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine. Computers in Industry, 56: 161-168.
  26. Sundararaghvan, P.S. and Mesbah, U.A. (1984). Minimizing the sum of absolute lateness in single machine and multi-machine scheduling. Naval Research Logistics, 31: 325-333.
  27. White, S.R. (1984). Concept of scale in simulated annealing. Proceedings of the IEEE International Conference on Computer Design, pp. 646-651.