How to cite this paper
Azizi, V., Jabbari, M & Kheirkhah, A. (2016). M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan.International Journal of Industrial Engineering Computations , 7(2), 309-322.
Refrences
Allahverdi, A., & Aldowaisan, T. (2001). Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times. Journal of the Operational Research Society, 52(4), 449-462.
Allahverdi, A., & Aydilek, H. (2014). Total completion time with makespan constraint in no-wait flowshops with setup times. European Journal of Operational Research, 238(3), 724-734.
Allahverdi, A., & Aldowaisan, T. (2002). No-wait flowshops with bicriteria of makespan and total completion time. Journal of the Operational Research Society, 53(9),1004-1015.
Ben Chihaoui, F., Kacem, I., Hadj-Alouane, A. B., Dridi, N., & Rezg, N. (2011). No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates. International Journal of Production Research, 49(21), 6273-6286.
Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115(1), 173-178.
Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188(2), 315-329.
Chen, P., Wu, C. C., & Lee, W. C. (2006). A bi-criteria two-machine flowshop scheduling problem with a learning effect. Journal of the Operational Research Society, 57(9), 1113-1125.
Cheng, T. C. E., Wu, C. C., Chen, J. C., Wu, W. H., & Cheng, S. R. (2013). Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. International Journal of Production Economics, 141(1), 79-86.
Cheng, T. E., & Wang, G. (2000). Single machine scheduling with learning effect considerations. Annals of Operations Research, 98(1-4), 273-290.
Ding, J. Y., Song, S., Gupta, J. N., Zhang, R., Chiong, R., & Wu, C. (2015). An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing, 30, 604-613.
Eren, T., & Güner, E. (2008). A bicriteria flowshop scheduling with a learning effect. Applied Mathematical Modelling, 32(9), 1719-1733.
Goldberg, D. E., & Holland, J. H. (1988). Genetic algorithms and machine learning. Machine learning, 3(2), 95-99.
??ler, M. C., Toklu, B., & Celik, V. (2012). Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect. The International Journal of Advanced Manufacturing Technology, 61(9-12), 1129-1137.
Janiak, A., Janiak, W. A., Rudek, R., & Wielgus, A. (2009). Solution algorithms for the makespan minimization problem with the general learning model. Computers & Industrial Engineering, 56(4), 1301-1308.
Kirkpatrick, S., & Vecchi, M. P. (1983). Optimization by simmulated annealing. Science, 220(4598), 671-680.
Lai, K., Hsu, P. H., Ting, P. H., & Wu, C. C. (2014). A Truncated Sum of Processing?Times–Based Learning Model for a Two?Machine Flowshop Scheduling Problem. Human Factors and Ergonomics in Manufacturing & Service Industries, 24(2), 152-160.
Lee, W. C., & Wu, C. C. (2004). Minimizing total completion time in a two-machine flowshop with a learning effect. International Journal of Production Economics, 88(1), 85-93.
Lee, W. C., & Wu, C. C. (2009). Some single-machine and m-machine flowshop scheduling problems with learning considerations. Information Sciences, 179(22), 3885-3892.
Li, D. C., Hsu, P. H., Wu, C. C., & Cheng, T. E. (2011). Two-machine flowshop scheduling with truncated learning to minimize the total completion time. Computers & Industrial Engineering, 61(3), 655-662.
Liu, Y., & Feng, Z. (2014). Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Computers & Industrial Engineering, 75, 170-175.
Murata, T., Ishibuchi, H., & Tanaka, H. (1996). Genetic algorithms for flowshop scheduling problems. Computers & Industrial Engineering, 30(4), 1061-1071.
Nagano, M. S., & Ara?jo, D. C. (2014). New heuristics for the no-wait flowshop with sequence-dependent setup times problem. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 36(1), 139-151.
Nagano, M. S., Da Silva, A. A., & Lorena, L. A. N. (2014). An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times. Expert Systems with Applications, 41(8), 3628-3633.
R?ck, H. (1984). The three-machine no-wait flowshop is NP-complete. Journal of the ACM (JACM), 31(2), 336-345.
Samarghandi, H., & ElMekkawy, T. Y. (2014). Solving the no-wait flow-shop problem with sequence-dependent set-up times. International Journal of Computer Integrated Manufacturing, 27(3), 213-228.
Shiau, Y. R., Tsai, M. S., Lee, W. C., & Cheng, T. C. E. (2015). Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Computers & Industrial Engineering, 87, 580-589.
Wang, J. B., & Liu, L. L. (2009). Two-machine flowshop problem with effects of deterioration and learning. Computers & Industrial Engineering, 57(3), 1114-1121.
Wang, J. B., & Wang, J. J. (2014). Flowshop scheduling with a general exponential learning effect. Computers & Operations Research, 43, 292-308.
Wang, J. B., & Xia, Z. Q. (2005). Flow-shop scheduling with a learning effect. Journal of the Operational Research Society, 56(11), 1325-1330.
Wang, J. J., & Zhang, B. H. (2015). Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Computers & Operations Research, 58, 24-31.
Wu, C. C., Lee, W. C., & Wang, W. C. (2007). A two-machine flowshop maximum tardiness scheduling problem with a learning effect. The International Journal of Advanced Manufacturing Technology, 31(7-8), 743-750.
Wu, Y. B., & Wang, J. J. (2015). Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Computing and Applications, 1-7.
Wu, W. H., Wu, W. H., Chen, J. C., Lin, W. C., Wu, J., & Wu, C. C. (2015). A heuristic-based genetic algorithm for the two-machine flowshop scheduling with learning consideration. Journal of Manufacturing Systems, 35, 223-233.
Ying, K. C., Lee, Z. J., Lu, C. C., & Lin, S. W. (2012). Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups. The International Journal of Advanced Manufacturing Technology, 58(5-8), 671-682.
Zhu, X., & Li, X. (2014). Iterative search method for total flowtime minimization no-wait flowshop problem. International Journal of Machine Learning and Cybernetics, 1-15.
Allahverdi, A., & Aydilek, H. (2014). Total completion time with makespan constraint in no-wait flowshops with setup times. European Journal of Operational Research, 238(3), 724-734.
Allahverdi, A., & Aldowaisan, T. (2002). No-wait flowshops with bicriteria of makespan and total completion time. Journal of the Operational Research Society, 53(9),1004-1015.
Ben Chihaoui, F., Kacem, I., Hadj-Alouane, A. B., Dridi, N., & Rezg, N. (2011). No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates. International Journal of Production Research, 49(21), 6273-6286.
Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115(1), 173-178.
Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188(2), 315-329.
Chen, P., Wu, C. C., & Lee, W. C. (2006). A bi-criteria two-machine flowshop scheduling problem with a learning effect. Journal of the Operational Research Society, 57(9), 1113-1125.
Cheng, T. C. E., Wu, C. C., Chen, J. C., Wu, W. H., & Cheng, S. R. (2013). Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. International Journal of Production Economics, 141(1), 79-86.
Cheng, T. E., & Wang, G. (2000). Single machine scheduling with learning effect considerations. Annals of Operations Research, 98(1-4), 273-290.
Ding, J. Y., Song, S., Gupta, J. N., Zhang, R., Chiong, R., & Wu, C. (2015). An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing, 30, 604-613.
Eren, T., & Güner, E. (2008). A bicriteria flowshop scheduling with a learning effect. Applied Mathematical Modelling, 32(9), 1719-1733.
Goldberg, D. E., & Holland, J. H. (1988). Genetic algorithms and machine learning. Machine learning, 3(2), 95-99.
??ler, M. C., Toklu, B., & Celik, V. (2012). Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect. The International Journal of Advanced Manufacturing Technology, 61(9-12), 1129-1137.
Janiak, A., Janiak, W. A., Rudek, R., & Wielgus, A. (2009). Solution algorithms for the makespan minimization problem with the general learning model. Computers & Industrial Engineering, 56(4), 1301-1308.
Kirkpatrick, S., & Vecchi, M. P. (1983). Optimization by simmulated annealing. Science, 220(4598), 671-680.
Lai, K., Hsu, P. H., Ting, P. H., & Wu, C. C. (2014). A Truncated Sum of Processing?Times–Based Learning Model for a Two?Machine Flowshop Scheduling Problem. Human Factors and Ergonomics in Manufacturing & Service Industries, 24(2), 152-160.
Lee, W. C., & Wu, C. C. (2004). Minimizing total completion time in a two-machine flowshop with a learning effect. International Journal of Production Economics, 88(1), 85-93.
Lee, W. C., & Wu, C. C. (2009). Some single-machine and m-machine flowshop scheduling problems with learning considerations. Information Sciences, 179(22), 3885-3892.
Li, D. C., Hsu, P. H., Wu, C. C., & Cheng, T. E. (2011). Two-machine flowshop scheduling with truncated learning to minimize the total completion time. Computers & Industrial Engineering, 61(3), 655-662.
Liu, Y., & Feng, Z. (2014). Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Computers & Industrial Engineering, 75, 170-175.
Murata, T., Ishibuchi, H., & Tanaka, H. (1996). Genetic algorithms for flowshop scheduling problems. Computers & Industrial Engineering, 30(4), 1061-1071.
Nagano, M. S., & Ara?jo, D. C. (2014). New heuristics for the no-wait flowshop with sequence-dependent setup times problem. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 36(1), 139-151.
Nagano, M. S., Da Silva, A. A., & Lorena, L. A. N. (2014). An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times. Expert Systems with Applications, 41(8), 3628-3633.
R?ck, H. (1984). The three-machine no-wait flowshop is NP-complete. Journal of the ACM (JACM), 31(2), 336-345.
Samarghandi, H., & ElMekkawy, T. Y. (2014). Solving the no-wait flow-shop problem with sequence-dependent set-up times. International Journal of Computer Integrated Manufacturing, 27(3), 213-228.
Shiau, Y. R., Tsai, M. S., Lee, W. C., & Cheng, T. C. E. (2015). Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Computers & Industrial Engineering, 87, 580-589.
Wang, J. B., & Liu, L. L. (2009). Two-machine flowshop problem with effects of deterioration and learning. Computers & Industrial Engineering, 57(3), 1114-1121.
Wang, J. B., & Wang, J. J. (2014). Flowshop scheduling with a general exponential learning effect. Computers & Operations Research, 43, 292-308.
Wang, J. B., & Xia, Z. Q. (2005). Flow-shop scheduling with a learning effect. Journal of the Operational Research Society, 56(11), 1325-1330.
Wang, J. J., & Zhang, B. H. (2015). Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Computers & Operations Research, 58, 24-31.
Wu, C. C., Lee, W. C., & Wang, W. C. (2007). A two-machine flowshop maximum tardiness scheduling problem with a learning effect. The International Journal of Advanced Manufacturing Technology, 31(7-8), 743-750.
Wu, Y. B., & Wang, J. J. (2015). Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Computing and Applications, 1-7.
Wu, W. H., Wu, W. H., Chen, J. C., Lin, W. C., Wu, J., & Wu, C. C. (2015). A heuristic-based genetic algorithm for the two-machine flowshop scheduling with learning consideration. Journal of Manufacturing Systems, 35, 223-233.
Ying, K. C., Lee, Z. J., Lu, C. C., & Lin, S. W. (2012). Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups. The International Journal of Advanced Manufacturing Technology, 58(5-8), 671-682.
Zhu, X., & Li, X. (2014). Iterative search method for total flowtime minimization no-wait flowshop problem. International Journal of Machine Learning and Cybernetics, 1-15.