Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption

References

• Abumaizar, R.J., & Svestka, J.A. (1997). Rescheduling job shops under random disruptions. International Journal of Production Research, 35, 2065–2082.
   Web of Science ®Google Scholar
• Akturk, M.S., & Gorgulu, E. (1999). Match-up scheduling under a machine breakdown. European Journal of Operational Research, 112, 81–97.
   Web of Science ®Google Scholar
• Alagoz, O., & Azizoglu, M. (2003). Rescheduling of identical parallel machines under machine eligibility constraints. European Journal of Operational Research, 149, 523–532.
   Web of Science ®Google Scholar
• Alidaee, B., & Womer, N.K. (1999). Scheduling with time dependent processing times: Review and extensions. The Journal of the Operations Research Society, 50, 711–720.
   Web of Science ®Google Scholar
• Aytug, H., Lawley, M.A., Mckay, K.N., Mohan, S., & Uzsoy, R. (2005). Executing production schedules in the face of uncertainties: A review and some future directions. European Journal of Operational Research, 161, 86–110.
   Web of Science ®Google Scholar
• Azizoglu, M., & Alagoz, O. (2005). Parallel-machine rescheduling with machine disruptions. IIE Transactions, 37, 1113–1118.
   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
• Chang, Y.-L., Sullivan, R.S., Bagchi, U., & Wilson, J.R. (1985). Experimental investigation of real-time scheduling in flexible manufacturing systems. Annals of Operations Research, 3, 355–377.
   Google Scholar
• Cheng, T.C.E., Ding, Q., & 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., & Lee, W.C. (2008). Some scheduling problems with deteriorating jobs and learning effects. Computers and Industrial Engineering, 54, 972–982.
   Web of Science ®Google Scholar
• Cheng, M.-B., & Zhang, B.-X. (2010). A note on single-machine rescheduling problems with learning effect under disruption. In L. Yang & D.-S. Wen (Eds.), Proceedings of the 2010 IEEE International Conference on Advanced Management Science (pp. 378–382). New York, NY: IEEE.
   Google Scholar
• Dong, Y.-H., & Jang, J. (2012). Production rescheduling for machine breakdown at a lob shop. International Journal of Production Research, 50, 2681–2691.
   Web of Science ®Google Scholar
• Fahmy, S.A., Balakrishnan, S., & El Mekkawy, T.Y. (2009). A generic deadlock-free reactive scheduling approach. International Journal of Production Research, 47, 5657–5676.
   Web of Science ®Google Scholar
• Farn, C.K., & Muhlemann, A.P. (1979). The dynamic aspects of a production scheduling problem. International Journal of Production Research, 17, 15–21.
   Web of Science ®Google Scholar
• Gomes, M.C., Barbosa-Povoa, A.P., & Novais, A.Q. (2010). A discrete time reactive scheduling model for new order insertion in job shop, make-to-order industries. International Journal of Production Research, 48, 7395–7422.
   Web of Science ®Google Scholar
• Graham, R.L., Lawler, E.L., Lenstra, J.K., & 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
• Guo, B., & Nonaka, Y. (1999). Rescheduling and optimization of schedules considering machine failures. International Journal of Production Economics, 60–61, 503–513.
   Web of Science ®Google Scholar
• Hall, N.G., Liu, Z.-X., & Potts, C.N. (2007). Rescheduling for multiple new orders. INFORMS Journal on Computing, 19, 633–645.
   Web of Science ®Google Scholar
• Hall, N.G., & Potts, C.N. (2004). Rescheduling for new orders. Operations Research, 52, 440–453.
   Web of Science ®Google Scholar
• Hall, N.G., & Potts, C.N. (2010). Rescheduling for job unavailability. Operations Research, 58, 746–755.
   Web of Science ®Google Scholar
• He, Y., & Sun, L. (in press). One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations. International Journal of Systems Science. doi: 10.1080/00207721.2013.822126.
   PubMed Web of Science ®Google Scholar
• Hoogeveen, H., Lente, C., & T'kindt, V. (2012). Rescheduling for new orders on a single machine with setup times. European Journal of Operational Research, 223, 40–46.
   Web of Science ®Google Scholar
• Huang, X., Wang, M.-Z., & Wang, J.-B. (2011). Single-machine group scheduling with both learning effects and deteriorating jobs. Computers and Industrial Engineering, 60, 750–754.
   Web of Science ®Google Scholar
• Jain, A.K., & Elmaraghy, H.A. (1997). Production scheduling/rescheduling in flexible manufacturing. International Journal of Production Research, 35, 281–309.
   Web of Science ®Google Scholar
• Janiak, A., & 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
• Katragjini, K., Vallada, E., & Ruiz, R. (2013). Flow shop rescheduling under different types of disruption. International Journal of Production Research, 51, 780–797.
   Web of Science ®Google Scholar
• Lee, W.-C., & Lai, P.-J. (2011). Scheduling problems with general effects of deterioration and learning. Information Sciences, 181, 1164–1170.
   Web of Science ®Google Scholar
• Li, R.-K., Shyu, Y.-T., & Adiga, S. (1993). A heuristic rescheduling algorithm for computer-based production scheduling systems. International Journal of Production Research, 31, 1815–1826.
   Web of Science ®Google Scholar
• Liu, C.-F., & Yang, S.-L. (2011). A hybrid genetic algorithm for integrated project task and multi-skilled workforce scheduling. Journal of Computational Information Systems, 7, 2187–2194.
   Google Scholar
• Liu, C.-F., & Yang, S.-L. (2012). Hybrid particle swarm optimization algorithm for solving learning workforce project schedule problem Computer Engineering, 38, 21–24.
   Google Scholar
• Low, C., & Lin, W.-Y. (2012). Single machine group scheduling with learning effects and past-sequence-dependent setup times. International Journal of Systems Science, 43, 1–8.
   Web of Science ®Google Scholar
• Mason, S.J., Jin, S., & Wessels, C.M. (2004). Rescheduling strategies for minimizing total weighted tardiness in complex job shops. International Journal of Production Research, 42, 613–628.
   Web of Science ®Google Scholar
• Moratori, P., Petrovic, S., & Vazquez-Rodriguez, J.A. (2012). Match-up approaches to a dynamic rescheduling problem. International Journal of Production Research, 50, 261–276.
   Web of Science ®Google Scholar
• Nelson, R.T., Holloway, C.A., & Wong, R.M.L. (1977). Centralized scheduling and priority implementation heuristics for a dynamic job shop model. IIE Transactions, 9, 95–102.
   Google Scholar
• Ouelhadj, D., & Petrovic, S. (2009). A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling, 12, 417–431.
   Web of Science ®Google Scholar
• Ozlen, M., & Azizoglu, M. (2009). Generating all efficient solutions of a rescheduling problem on unrelated parallel machines. International Journal of Production Research, 47, 5245–5270.
   Web of Science ®Google Scholar
• Ozlen, M., & Azizoglu, M. (2011). Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria. Journal of the Operational Research Society, 62, 152–164.
   Web of Science ®Google Scholar
• Rangsaritratsamee, R., Ferrell, W.G. Jr, & Kurz, M.B. (2004). Dynamic rescheduling that simultaneously considers efficiency and stability. Computers and Industrial Engineering, 46, 1–15.
   Web of Science ®Google Scholar
• Souier, M., Sari, Z., & Hassam, A. (2013). Real-time rescheduling metaheuristic algorithms applied to FMS with routing flexibility. International Journal of Advanced Manufacturing Technology, 64, 145–164.
   Web of Science ®Google Scholar
• Sun, L. (2009). Single-machine scheduling problems with deteriorating jobs and learning effects. Computers and Industrial Engineering, 57, 843–846.
   Web of Science ®Google Scholar
• Suwa, H., & Sandoh, H. (2007). Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns. Computers and Industrial Engineering, 53, 63–78.
   Web of Science ®Google Scholar
• Tang, L.-X., & Zhang, Y.-Y. (2009). Parallel machine scheduling under the disruption of machine breakdown. Industrial and Engineering Chemistry Research, 48, 6660–6667.
   Web of Science ®Google Scholar
• Unal, A.T., Uzsoy, R., & Kiran, A.S. (1997). Rescheduling on a single machine with part-type dependent setup times and deadlines. Annals of Operations Research, 70, 93–113.
   Web of Science ®Google Scholar
• Vieira, G.E., Herrmann, J.W., & Lin, E. (2003). Rescheduling manufacturing systems: A framework of strategies, policies, and methods. Journal of Scheduling, 6, 39–62.
   Web of Science ®Google Scholar
• Wang, J.-B. (2006). A note on scheduling problems with learning effect and deteriorating jobs. International Journal of Systems Science, 37, 827–833.
   Web of Science ®Google Scholar
• Wang, J.-B. (2007). Single-machine scheduling problems with the effects of learning and deterioration. Omega, 35, 397–402.
   Web of Science ®Google Scholar
• Wang, X.-L., & Cheng, T.C.E. (2007a). Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research, 178, 57–70.
   Web of Science ®Google Scholar
• Wang, J.-B., & Cheng, T.C.E. (2007b). Scheduling problems with the effects of deterioration and learning. Asia-Pacific Journal of Operational Research, 24, 1–17.
   Web of Science ®Google Scholar
• Wang, L.-Y., & Feng, E.-M. (2012). A note on single-machine scheduling problems with the effects of deterioration and learning. International Journal of Advanced Manufacturing Technology, 59, 539–545.
   Web of Science ®Google Scholar
• Wang, J.-B., Wang, M.-Z., & Ji, P. (2012). Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs. International Journal of Systems Science, 43, 861–868.
   Web of Science ®Google Scholar
• Wright, T.P. (1936). Factors affecting the cost of airplanes. Journal of the Aeronautical Sciences, 3, 122–128.
   Google Scholar
• Wu, M.-C., & Sun, S.-H. (2006). A project scheduling and staff assignment model considering learning effect. International Journal of Advanced Manufacturing Technology, 28, 1190–1195.
   Web of Science ®Google Scholar
• Wu, S.D., Storer, R.H., & Chang, P.-C. (1993). One-machine rescheduling heuristics with efficiency and stability as criteria. Computers and Operations Research, 20, 1–14.
   Web of Science ®Google Scholar
• Yamamoto, M., & Nof, S.Y. (1985). Scheduling/rescheduling in the manufacturing operating system environment. International Journal of Production Research, 23, 705–722.
   Web of Science ®Google Scholar
• Yang, B.-B. (2007). Single machine rescheduling with new jobs arrivals and processing time compression. International Journal of Advanced Manufacturing Technology, 34, 378–384.
   Web of Science ®Google Scholar
• Yuan, J.-J., & Mu, Y.-D. (2007). Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. European Journal of Operational Research, 182, 936–944.
   Web of Science ®Google Scholar
• Yuan, J.-J., Mu, Y.-D., Lu, L.-F., & Li, W.-H. (2007). Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan. Asia-Pacific Journal of Operational Research, 24, 789–796.
   Web of Science ®Google Scholar
• Zakaria, Z., & Petrovic, S. (2012). Genetic algorithms for match-up rescheduling of the flexible manufacturing systems. Computers and Industrial Engineering, 62, 670–686.
   Web of Science ®Google Scholar
• Zhao, C.-L., & Tang, H.-Y. (2010). Rescheduling problems with deteriorating jobs under disruptions. Applied Mathematical Modelling, 34, 238–243.
   Web of Science ®Google Scholar