Flow shop rescheduling under different types of disruption

International Journal of Production Research

Volumn 51, Issue 3, 2013, Pages 780-797

  Katragjini, Ketrina ^a   Vallada, Eva ^a   Ruiz, Rubén ^a  

^a INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

Author keywords

flow shop scheduling; rescheduling; stability; uncertainty

Indexed keywords

FLOW SHOP RESCHEDULING; FLOW-SHOP SCHEDULING; FLOW-SHOPS; MANUFACTURING FACILITY; PRODUCTION COST; PRODUCTION OPERATIONS; PRODUCTION PLANNING AND SCHEDULING; RESCHEDULING; UNCERTAINTY;

CONVERGENCE OF NUMERICAL METHODS; PRODUCTION CONTROL;

MACHINE SHOP PRACTICE;

EID: 84871191131     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2012.666856     Document Type: Article

References (58)

1. Abumaizar, R.J. and Svestka, J.A., 1997. Rescheduling job shops under random disruptions. International Journal of Production Research, 35 (7), 2065-2082. (Pubitemid 127549712)
2. Adiri, I., Frostig, E., and Kan, A.H.G.R., 1991. Scheduling on a single-machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Research Logistics, 38 (2), 261-271.
3. Akturk, M.S. and Gorgulu, E., 1999. Match-up scheduling under a machine breakdown. European Journal of Operational Research, 112 (1), 81-97.
4. Al Kattan, I. and Maragoud, R., 2008. Performance analysis of flowshop scheduling using genetic algorithm enhanced with simulation. International Journal of Industrial Engineering-Theory, Applications and Practice, 15 (1), 62-72.
5. Allahverdi, A., 1996. Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computers and Operations Research, 23 (10), 909-916.
6. Arnaut, J.P. and Rabadi, G., 2008. Rescheduling of unrelated parallel machines under machine breakdowns. International Journal of Applied Management Science, 1 (1), 75-89.
7. Artigues, C., Billaut, J.C., and Esswein, C., 2005. Maximization of solution flexibility for robust shop scheduling. European Journal Of Operational Research, 165 (2), 314-328. (Pubitemid 40206364)
8. Azizoglu, M. and Alagoz, O., 2005. Parallel-machine rescheduling with machine disruptions. IIE Transactions, 37 (12), 1113-1118. (Pubitemid 41694331)
9. Bean, J.C., et al., 1991. Matchup scheduling with multiple resources, release dates and disruptions. Operations Research, 39 (3), 470-483.
10. Caricato, P. and Grieco, A., 2008. An online approach to dynamic rescheduling for production planning applications. International Journal of Production Research, 46 (16), 4597-4617.
11. Church, L.K. and Uzsoy, R., 1992. Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Journal of Computer Integrated Manufacturing, 5 (3), 153-163.
12. Cowling, P. and Johansson, M., 2002. Using real time information for effective dynamic scheduling. European Journal of Operational Research, 139 (2), 230-244. (Pubitemid 34201236)
13. Curry, J. and Peters, B., 2005. Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives. International Journal of Production Research, 43 (15), 3231-3246. (Pubitemid 41657434)
14. Dutta, A., 1990. Reacting to scheduling exceptions in FMS environments. IIE Transactions, 22 (4), 300-314. (Pubitemid 21651802)
15. Gantt, H.L., 1919. Work, wages, and profits. 2nd ed. New York: The Engineering Magazine Co.
16. Ghezail, F., Pierreval, H., and Hajri-Gabouj, S., 2010. Analysis of robustness in proactive scheduling: a graphical approach. Computers & Industrial Engineering, 58 (2), 193-198.
17. Goren, S. and Sabuncuoglu, I., 2008. Robustness and stability measures for scheduling: single-machine environment. IIE Transactions, 40 (1), 66-83. (Pubitemid 350110976)
18. Graham, R.L., et al., 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of discrete mathematics. Amsterdam: Elsevier, 287-326.
19. Hall, N.G. and Potts, C.N., 2004. Rescheduling for new orders. Operations Research, 52 (3), 440-453.
20. Herrmann, J.V., Lee, C., and Snowdown, J.L., 1993. A classification of static scheduling problems. In: P.M. Pardalos, ed. Complexity in numerical optimization. Singapore: World Scientific, 203-253.
21. Herroelen, W. and Leus, R., 2005. Project scheduling under uncertainty: survey and research potentials. European Journal of Operational Research, 165 (2), 289-306. (Pubitemid 40206362)
22. Hoos, H.H. and Stützle, T., 2004. Stochastic local search: foundations and applications. San Francisco, CA: Morgan Kaufmann.
23. Hozak, K. and Hill, J., 2009. Issues and opportunities regarding replanning and rescheduling frequencies. International Journal of Production Research, 47 (18), 4955-4970.
24. Huatuco, L.H., et al., 2009. Comparing the impact of different rescheduling strategies on the entropic-related complexity of manufacturing systems. International Journal of Production Research, 47 (15), 4305-4325.
25. Jensen, M.T., 2003. Generating robust and flexible job shop schedules using genetic algorithms. IEEE Transactions on Evolutionary Computation, 7 (3), 275-288.
26. King, J.R., 1976. The theory-practice gap in job-shop scheduling. Production Engineer, 55 (3), 137-143.
27. Kopanos, G.M., et al., 2008. Costs for rescheduling actions: a critical issue for reducing the gap between scheduling theory and practice. Industrial and Engineering Chemistry Research, 47 (22), 8785-8795.
28. Lee, C.Y., Leung, J.Y.T., and Yu, G., 2006. Two machine scheduling under disruptions with transportation considerations. Journal of Scheduling, 9 (1), 35-48. (Pubitemid 43063748)
29. Li, Z. and Ierapetritou, M., 2008. Process scheduling under uncertainty: review and challenges. Computers and Chemical Engineering, 32 (4/5), 715-727. (Pubitemid 351199674)
30. Liao, C.J. and Chen, W.J., 2004. Scheduling under machine breakdown in a continuous process industry. Computers and Operations Research, 31 (3), 415-428. (Pubitemid 38092935)
31. Mehta, S.V. and Uzsoy, R., 1999. Predictable scheduling of a single machine subject to breakdowns. International Journal of Computer Integrated Manufacturing, 12 (1), 15-38. (Pubitemid 129607547)
32. Montgomery, D.C., 2007. Design and analysis of experiments. 5th ed. New York: Wiley.
33. Muhlemann, A.P., Lockett, A.G., and Farns, C.K., 1982. Job shop scheduling heuristics and frequency of scheduling. International Journal of Production Research, 20 (2), 227-241.
34. Nawaz, M., Enscore, E.E., and Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega-International Journal of Management Science, 11 (1), 91-95. (Pubitemid 13193807)
35. O'Donovan, R., Uzsoy, R., and Mckay, K.N., 1999. Predictable scheduling of a single machine with breakdowns and sensitive jobs. International Journal of Production Research, 37 (18), 4217-4233. (Pubitemid 30519011)
36. Ozlen, M. and Azizoglu, M., 2009. Generating all efficient solutions of a rescheduling problem on unrelated parallel machines. International Journal of Production Research, 47 (19), 5245-5270.
37. Pfeiffer, A., Kadar, B., and Monostori, L., 2007. Stability-oriented evaluation of rescheduling strategies, by using simulation. Computers in Industry, 58 (7), 630-643. (Pubitemid 47058181)
38. Pierreval, H. and Durieux-Paris, S., 2007. Robust simulation with a base environmental scenario. European Journal Of Operational Research, 182 (2), 783-793. (Pubitemid 46667209)
39. Pinedo, M., 2008. Scheduling: theory, algorithms and systems. 3rd ed. New York: Springer.
40. Purushothaman, D., Hirani, N.S., and Velez-Gallego, C.M., 2009. Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. European Journal of Industrial Engineering, 3 (2), 187-206.
41. Qi, X.T., Bard, J.F., and Yu, G., 2006. Disruption management for machine scheduling: the case of SPT schedules. International Journal of Production Economics, 103 (1), 166-184. (Pubitemid 43866474)
42. Rangsaritratsamee, R., Ferrell, W.G., and Kurz, M.B., 2004. Dynamic rescheduling that simultaneously considers efficiency and stability. Computers and Industrial Engineering, 46 (1), 1-15.
43. Ruiz, R. and Stützle, T., 2007. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177 (3), 2033-2049. (Pubitemid 44712036)
44. Sabuncuoglu, I. and Goren, S., 2009. Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. International Journal of Computer Integrated Manufacturing, 22 (2), 138-157.
45. Sabuncuoglu, I. and Kizilisik, O.B., 2003. Reactive scheduling in a dynamic and stochastic FMS environment. International Journal of Production Research, 41 (17), 4211-4231.
46. Salveson, M.E., 1952. On a quantitative method in production planning and scheduling. Econometrica, 20 (4), 554-590.
47. Samarghandi, H. and ElMekkawy, T.Y., 2011. An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server. European Journal of Industrial Engineering, 5 (2), 111-131.
48. Steele, D.C., 1975. The nervous MRP system: how to do battle. Production and Inventory Management, 16 (4), 83-89.
49. Subramaniam, V., Raheja, A.S., and Reddy, K.R.B., 2005. Reactive repair tool for job shop schedules. International Journal of Production Research, 43 (1), 1-23. (Pubitemid 41646826)
50. Taillard, E., 1990. Some efficient heuristic methods for the flow-shop sequencing problem. European Journal of Operational Research, 47 (1), 65-74. (Pubitemid 20733430)
51. Taillard, E., 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64 (2), 278-285. (Pubitemid 23599340)
52. Valente, J.M.S. and Schaller, J.E., 2010. Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties. European Journal of Industrial Engineering, 4 (1), 99-129.
53. Vallada, E. and Ruiz, R., 2010. Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega-International Journal of Management Science, 38 (1/2), 57-67.
54. Vieira, G.E., Herrmann, J.W., and Lin, E., 2000. Predicting the performance of rescheduling strategies for parallel machine systems. Journal of Manufacturing Systems, 19 (4), 256-266.
55. Vieira, G.E., Herrmann, J.W., and Lin, E., 2003. Rescheduling manufacturing systems: a framework of strategies, policies, and methods. Journal of Scheduling, 6 (1), 39-62.
56. Vollmann, T.E., et al., 2005. Manufacturing planning and control for supply chain management. 5th ed. New York: McGraw Hill.
57. Yang, J. and Yu, G., 2002. On the robust single machine scheduling problem. Journal of Combinatorial Optimization, 6 (1), 17-33. (Pubitemid 34130061)
58. Zandieh, M. and Gholami, M., 2009. An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Production Research, 47 (24), 6999-7027.