A reliability/availability approach to joint production and maintenance scheduling with multiple preventive maintenance services

International Journal of Production Research

Volumn 50, Issue 20, 2012, Pages 5906-5925

  Mokhtari, Hadi ^a   Mozdgir, Ashkan ^b   Kamal Abadi, Isa Nakhai ^a  

^a TARBIAT MODARES UNIVERSITY   (Iran)

^b PAYAME NOOR UNIVERSITY   (Iran)

Author keywords

multiple repair rates; population based variable neighbourhood search; preventive maintenance; production scheduling; reliability availability approach

Indexed keywords

BASIC VARIABLES; COMPUTATIONAL STUDIES; JOINT PRODUCTION; LOCAL SEARCH; MAINTENANCE SCHEDULING; MIXED INTEGER NONLINEAR PROGRAMMING MODELS; NUMBER OF ITERATIONS; PLANNING HORIZONS; PRODUCTION SCHEDULING; REALISTIC ENVIRONMENTS; REPAIR RATE; SCHEDULING PROBLEM; SOLUTION METHODS; VARIABLE NEIGHBOURHOOD SEARCH;

ALGORITHMS; ITERATIVE METHODS; PRODUCTION CONTROL; PRODUCTION ENGINEERING; SCHEDULING;

PREVENTIVE MAINTENANCE;

EID: 84867340592     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.637092     Document Type: Article

References (51)

1. Aggoune, R. and Portmann, M., 2006. Flow shop scheduling problem with limited machine availability: A heuristic approach. International Journal of Production Economics, 99 (1-2), 4-15.
2. Aggoune, R., 2003. Minimizing the makespan for the flow shop scheduling problem with availability constraints. European Journal of Operational Research, 153 (3), 534-543.
3. Allaoui, A., et al., 2006. Scheduling of a two machine flowshop with availability constraints on the first machine. International Journal of Production Economics, 99 (1-2), 16-27.
4. Almada-Lobo, B., Oliveira, J.F., and Carravilla, M.A., 2008. Production planning and scheduling in the glass container industry: A VNS approach. International Journal of Production Economics, 114 (1), 363-375.
5. Bean, J.C., 1994. Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing, 6 (6), 154-160.
6. Berrichi, A., et al., 2008. Bi-objective optimization algorithms for joint production and maintenance scheduling: Application to the parallel machine problem. Journal of Intelligent Manufacturing, 20 (4), 389-400.
7. Berrichi, A., et al., 2010. Bi-objective ant colony optimisation approach to optimize production and maintenance scheduling. Computers & Operations Research, 37 (9), 1584-1596.
8. Ben Ali, M., et al., 2011. Simultaneous scheduling of production and maintenance tasks in the job shop. International Journal of Production Research, 49 (13), 3891-3918.
9. Blazewicz, J., et al., 2001. Heuristic algorithms for the two-machine flowshop problem with limited machine availability. Omega Journal, 29 (6), 599-608.
10. Cheng, T. and Liu, Z., 2003. Approximability of two-machine no-wait flowshop scheduling with availability constraints. Operations Research Letters, 31 (4), 319-322.
11. Driessel, R. and Monch, L., 2011. Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Computers and Industrial Engineering, 61 (2), 336-345.
12. Ebeling, C.E., 1997. An introduction to reliability and maintainability engineering. USA: McGraw-Hill.
13. Espinouse, M., Formanowlcz, P., and Penz, B., 2001. Complexity results and approximation algorithms for the two-machine no-wait flow-shop with limited machine availability. Journal of the Operational Research Society, 52 (1), 116-121.
14. Finke, D.A., Medeiros, D.J., and Traband, M.T., 2007. Multiple machine JIT scheduling: A tabu search approach. International Journal of Production Research, 45 (21), 4899-4915.
15. Garey, M.R. and Johnson, D.S., 1979. Computers and intractability: A guide to the theory of NP-completeness. San Francisco, California: W.H. Freeman and Company.
16. Goncalves, J.F. and Sousa, P.S.A., 2011. A genetic algorithm for lot sizing and scheduling under capacity constraints and allowing backorders. International Journal of Production Research, 49 (9), 2683-2703.
17. Hasan, S.M.K., Sarker, R., and Essam, D., 2011. Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns. International Journal of Production Research, 49 (16), 4999-5015.
18. Jain, V., Swarnkar, R., and Tiwari, M.K., 2003. Modelling and analysis of wafer fabrication scheduling via generalised stochastic Petri net and simulated annealing. International Journal of Production Research, 41 (15), 3501-3527.
19. Ji, M., He, Y., and Cheng, T.C.E., 2007. Single-machine scheduling with periodic maintenance to minimize makespan. Computers and Operations Research, 34 (6), 1764-1770.
20. Kubiak, W., et al., 2002. Two-machine flow shops with limited machine availability. European Journal of Operational Research, 136 (3), 528-540.
21. Lee, C.Y. and Liman, S.D., 1993. Capacitated two-parallel machines scheduling to minimize sum of job completion times. Discrete Applied Mathematics, 41 (3), 211-222.
22. Lee, C.Y., 1996. Machine scheduling with an availability constraint. Journal of Global Optimisation, 9 (3-4), 395-416.
23. Lee, C.Y., 1999. Two-machine flowshop scheduling with availability constraints. European Journal of Operational Research, 114 (2), 420-429.
24. Li, K. and Cheng, B.-Y., 2010. Variable neighbourhood search for uniform parallel machine makespan scheduling problem with release dates. Proceedings international symposium on computational intelligence and design, ISCID 2010 2, art. no. 5692729, 43-46.
25. Liao, C.-J. and Chen, W.J., 2003. Single-machine scheduling with periodic maintenance and nonresumable jobs. Computers & Operations Research, 30 (9), 1335-1347.
26. Liao, C.-J. and Cheng, C.-C., 2007. A variable neighborhood search for minimising single machine weighted earliness and tardiness with common due date. Computers & Industrial Engineering, 52 (4), 404-413.
27. Liao, C.-J., Shyur, D.-L., and Lin, C.-H., 2005. Makespan minimisation for two parallel machines with an availability constraint. European Journal of Operational Research, 160 (2), 445-456.
28. Low, C., et al., 2010. Minimising the makespan in a single machine scheduling problems with flexible and periodic maintenance. Applied Mathematical Modeling, 34 (2), 334-342.
29. Ma, Y., Chu, C., and Zuo, C., 2010. A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering, 58 (2), 199-211.
30. Mati, Y., 2010. Minimising the makespan in the non-preemptive job-shop scheduling with limited machine availability. Computers & Industrial Engineering, 59 (4), 537-543.
31. Mladenovic, N. and Hansen, P., 1997. Variable neighborhood search. Computers and Operations Research, 24 (11), 1097-1100.
32. Mokhtari, H., Baradaran Kazemzadeh, R., and Salmasnia, A., 2011. Time-cost tradeoff analysis in project management: An ant system approach. IEEE Transactions on Engineering Management, 58 (1), 36-43.
33. Mokhtari, H., Kamal Abadi, I.N., and Cheraghalikhani, A., 2011a. A multi objective flow shop scheduling with resourcedependent processing times: Tradeoff between makespan and cost of resources. International Journal of Production Research, 49 (19), 5851-5875.
34. Mokhtari, H., Kamal Abadi, I.N. and Amin-Naseri, M.R., 2011b. Production scheduling with outsourcing scenarios: A mixed integer programming and efficient solution procedure. International Journal of Production Research, in press.
35. Moradi, E., Fatemi Ghomi, S.M.T., and Zandieh, M., 2011. Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem. Expert Systems with Applications, 38 (6), 7169-7178.
36. Moradi, E. and Zandieh, M., 2010. Minimizing the makespan and the system unavailability in parallel machine scheduling problem: A similarity-based genetic algorithm. International Journal of Advanced Manufacturing Technology, 51 (5-8), 829-840.
37. Naderi, B., Zandieh, M., and Fatemi Ghomi, S.M.T., 2009. A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. Journal of Intelligent Manufacturing, 20 (6), 683-694.
38. Palaniappan, P.K. and Jawahar, N., 2011. A genetic algorithm for simultaneous optimization of lot sizing and scheduling in a flow line assembly. International Journal of Production Research, 49 (2), 375-400.
39. Perez, J.A.M., Vega, J.M.M., and Martin, I.R., 2003. Variable neighborhood tabu search and its application to the median cycle problem. European Journal of Operational Research, 151 (2), 365-378.
40. Pitts, R.A. and Ventura, J.A., 2009. Scheduling flexible manufacturing cells using Tabu Search. International Journal of Production Research, 47 (24), 6907-6928.
41. Polacek, M., et al., 2004. A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics, 10 (6), 613-627.
42. Roy, B., 2010. Robustness in operational research and decision aiding: A multi-faceted issue. European Journal of Operational Research, 200 (3), 629-638.
43. Ruiz, R., García-Díaz, J.C., and Maroto, C., 2007. Considering scheduling and preventive maintenance in the flowshop sequencing problem. Computers & Operations Research, 34 (11), 3314-3330.
44. Sarcicek, I. and Celik, C., 2011. Two meta-heuristics for parallel machine scheduling with job splitting to minimise total tardiness. Applied Mathematical Modelling, 35 (8).
45. Seo, M. and Kim, D., 2010. Ant colony optimisation with parameterized search space for the job shop scheduling problem. International Journal of Production Research, 48 (4), 1143-1154.
46. Schmidt, G., 2000. Scheduling with limited machine availability. European Journal of Operational Research, 121 (1), 1-15.
47. Vieira, G.E. and Ribas, P.C., 2004. A new multi-objective optimization method for master production scheduling problems using simulated annealing. International Journal of Production Research, 42 (21), 4609-4622.
48. Wang, X. and Tang, L., 2009. A population-based variable neighborhood search for the single machine total weighted tardiness problem. Computers & Operations Research, 36 (6), 2105-2110.
49. Xie, J. and Wang, X., 2005. Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints. Computers and Mathematics with Applications, 50 (10-12), 1629-1638.
50. Xu, D., Sun, K., and Li, H., 2008. Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimise makespan. Computers & Operations Research, 35 (4), 1344-1349.
51. Yang, D.L., et al., 2002. Minimizing the makespan in a single machine scheduling problem with a flexible maintenance. Journal of the Chinese Institute of Industrial Engineers, 19 (1), 63-66.