References
- Azzouz, A., Ennigrou, M., & Said, L. B. (2018). Scheduling problems under learning effects: Classification and cartography. International Journal of Production Research, 56(4), 1642–1661. https://doi.org/https://doi.org/10.1080/00207543.2017.1355576
- Bai, D., Tang, M., Zhang, Z.-H., & Santibanez-Gonzalez, E. D. R. (2018). Flow shop learning effect scheduling problem with release dates. Omega, 78, 21–38. https://doi.org/https://doi.org/10.1016/j.omega.2017.10.002
- Ben-Arieh, D., & Maimon, O. (1992). Annealing method for PCB assembly scheduling on two sequential machines. International Journal of Computer Integrated Manufacturing, 5(6), 361–367. https://doi.org/https://doi.org/10.1080/09511929208944543
- Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115(1), 173–178. https://doi.org/https://doi.org/10.1016/S0377-2217(98)00246-X
- Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188(2), 315–329. https://doi.org/https://doi.org/10.1016/j.ejor.2007.05.040
- Cheng, T. C. E., Kuo, W.-H., & Yang, D.-L. (2013a). Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position. Information Sciences, 221, 490–500. https://doi.org/https://doi.org/10.1016/j.ins.2012.09.001
- Cheng, T. C. E., Wu, C.-C., Chen, J.-C., Wu, W.-H., & Cheng, S.-R. (2013b). Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. International Journal of Production Economics, 141(1), 79–86. https://doi.org/https://doi.org/10.1016/j.ijpe.2012.03.027
- Framinan, J. M., & Leisten, R. (2003). An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega, 31(4), 311–317. https://doi.org/https://doi.org/10.1016/S0305-0483(03)00047-1
- Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129. https://doi.org/https://doi.org/10.1287/moor.1.2.117
- Gawiejnowicz, S. (1996). A note on scheduling on a single processor with speed dependent on a number of executed jobs. Information Processing Letters, 57(6), 297–300. https://doi.org/https://doi.org/10.1016/0020-0190(96)00021-X
- Geng, X.-N., Wang, J.-B., & Bai, D. (2019). Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Engineering Optimization, 51(8), 1301–1323. https://doi.org/https://doi.org/10.1080/0305215X.2018.1521397
- Gerstl, E., Mor, B., & Mosheiov, G. (2017). Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection. Computers & Operations Research, 83, 150–156. https://doi.org/https://doi.org/10.1016/j.cor.2017.02.010
- Gonzalez, T., & Sahni, S. (1978). Flowshop and jobshop schedules: Complexity and approximation. Operations Research, 26(1), 36–52. https://doi.org/https://doi.org/10.1287/opre.26.1.36
- Janiak, A., Janiak, W., Rudek, R., & Wielgus, A. (2009). Solution algorithms for the makespan minimization problem with the general learning model. Computers & Industrial Engineering, 56(4), 1301–1308. https://doi.org/https://doi.org/10.1016/j.cie.2008.07.019
- Kirkpatrick, S., Gelatt, C., & Vecchi, M. (1983). Optimisation by simulated annealing. Science (New York, N.Y.), 220(4598), 671–680. https://doi.org/https://doi.org/10.1126/science.220.4598.671
- Koulamas, C. (2020). The proportionate flow shop total tardiness problem. European Journal of Operational Research, 284(2), 439–444. https://doi.org/https://doi.org/10.1016/j.ejor.2020.01.002
- Koulamas, C., & Kyparisis, G. J. (2007). Single-machine and two-machine flowshop scheduling with general learning functions. European Journal of Operational Research, 178(2), 402–407. https://doi.org/https://doi.org/10.1016/j.ejor.2006.01.030
- Kuo, W.-H., Hsu, C.-J., & Yang, D.-L. (2012). Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect. Information Sciences, 184(1), 282–297. https://doi.org/https://doi.org/10.1016/j.ins.2011.08.018
- 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., & Chung, Y.-H. (2013). Permutation flowshop scheduling to minimize the total tardiness with learning effects. International Journal of Production Economics, 141(1), 327–334. https://doi.org/https://doi.org/10.1016/j.ijpe.2012.08.014
- Li, G., Wang, X.-Y., Wang, J.-B., & Sun, L.-Y. (2013). Worst case analysis of flow shop scheduling problems with a time-dependent learning effect. International Journal of Production Economics, 142(1), 98–104. https://doi.org/https://doi.org/10.1016/j.ijpe.2012.10.015
- 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. https://doi.org/https://doi.org/10.1016/j.cie.2014.06.017
- Liu, F., Wang, S., Hong, Y., & Yue, X. (2017). On the robust and stable flowshop scheduling under stochastic and dynamic disruptions. IEEE Transactions on Engineering Management, 4(64), 539–553. https://doi.org/https://doi.org/10.1109/TEM.2017.2712611
- Lu, Y.-Y. (2016). Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs. Applied Mathematical Modelling, 40(4), 3447–3450. https://doi.org/https://doi.org/10.1016/j.apm.2015.09.081
- Mor, B., & Shapira, D. (2019). Scheduling with regular performance measures and optional job rejection on a single machine. Journal of the Operational Research Society, 1–11. https://doi.org/https://doi.org/10.1080/01605682.2019.1621222
- Mosheiov, G., & Oron, D. (2012). Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times. Computers & Operations Research, 39(7), 1601–1604.
- Niu, Y.-P., Wan, L., & Wang, J.-B. (2015). A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect. Asia-Pacific Journal of Operational Research, 32(2), 1550001–1550012. https://doi.org/https://doi.org/10.1142/S0217595915500013
- Pan, Q.-K., & Ruiz, R. (2013). A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Computers & Operations Research, 40(1), 117–128. https://doi.org/https://doi.org/10.1016/j.cor.2012.05.018
- Pinedo, M. (2016). Scheduling: Theory, Algorithms and Systems (Fifth Edition). Prentice-Hall.
- Przybylski, B. (2018). A new model of parallel-machine scheduling with integral-based learning effect. Computers & Industrial Engineering, 121, 189–194. https://doi.org/https://doi.org/10.1016/j.cie.2018.05.035
- Rodney, D. S., Richard, M. W., & James, D. J. (1995). Cost estimator’s reference manual (2nd ed.). Wiley.
- Rudek, R. (2011). Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect. Computers & Industrial Engineering, 61(1), 20–31. https://doi.org/https://doi.org/10.1016/j.cie.2011.02.005
- Rudek, R. (2013). The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times. Applied Mathematics and Computation, 221, 819–832. https://doi.org/https://doi.org/10.1016/j.amc.2013.06.086
- Rudek, R. (2017). The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: Strongly NP-hard. Applied Mathematical Modelling, 50, 314–332. https://doi.org/https://doi.org/10.1016/j.apm.2017.05.034
- Rudek, A., & Rudek, R. (2013). Makespan minimization flowshop with position dependent job processing times-computational complexity and solution algorithms. Computers & Operations Research, 40(8), 2071–2082. https://doi.org/https://doi.org/10.1016/j.cor.2013.02.024
- Shabtay, D., & Oron, D. (2016). Proportionate flow-shop scheduling with rejection. Journal of the Operational Research Society, 67(5), 752–769. https://doi.org/https://doi.org/10.1057/jors.2015.95
- 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. https://doi.org/https://doi.org/10.1016/j.cie.2015.05.032
- Smutnicki, C. (1998). Some results of worst-case analysis for flow shop scheduling. European Journal of Operational Research, 109(1), 66–87. https://doi.org/https://doi.org/10.1016/S0377-2217(97)00139-2
- Sun, L.-H., Cui, K., Chen, J.-H., Wang, J., & He, X.-C. (2013a). Research on permutation flow shop scheduling problems with general position-dependent learning effects. Annals of Operations Research, 211(1), 473–480. https://doi.org/https://doi.org/10.1007/s10479-013-1481-6
- Sun, L.-H., Cui, K., Chen, J.-H., Wang, J., & He, X.-C. (2013b). Some results of the worst-case analysis for flow shop scheduling with a learning effect. Annals of Operations Research, 211(1), 481–490. https://doi.org/https://doi.org/10.1007/s10479-013-1368-6
- Wang, J.-B., Gao, M., Wang, J.-J., Liu, L., & He, H. (2019a). Scheduling with a position-weighted learning effect and job release dates. Engineering Optimization, 52(9), 1475–1493. https://doi.org/https://doi.org/10.1080/0305215X.2019.1664498
- Wang, J.-B., Liu, F., & Wang, J.-J. (2019b). Research on m-machine flow shop scheduling with truncated learning effects. International Transactions in Operational Research, 26(3), 1135–1151. https://doi.org/https://doi.org/10.1111/itor.12323
- Wang, J.-B., & Wang, J.-J. (2014a). Flowshop scheduling with a general exponential learning effect. Computers & Operations Research, 43, 292–308. https://doi.org/https://doi.org/10.1016/j.cor.2013.09.001
- Wang, J.-B., & Wang, M.-Z. (2012). Worst-case analysis for flow shop scheduling problems with an exponential learning effect. Journal of the Operational Research Society, 63(1), 130–137. https://doi.org/https://doi.org/10.1057/jors.2011.40
- Wang, J.-B., & Wang, M.-Z. (2014b). Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia-Pacific Journal of Operational Research, 31(05), 1450036–1450015. https://doi.org/https://doi.org/10.1142/S0217595914500365
- 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. https://doi.org/https://doi.org/10.1016/j.cor.2014.12.006
- Wang, J.-B., Zhang, B., Li, L., Bai, D., & Feng, Y.-B. (2020). Due window assignment scheduling problems with position-dependent weights on a single machine. Engineering Optimization, 52(2), 185–193. https://doi.org/https://doi.org/10.1080/0305215X.2019.1577411
- Wang, X.-Y., Zhou, Z., Zhang, X., Ji, P., & Wang, J.-B. (2013). Several flow shop scheduling problems with truncated position-based learning effect. Computers & Operations Research, 40(12), 2906–2929. https://doi.org/https://doi.org/10.1016/j.cor.2013.07.001
- Wu, C.-C., Hsu, P.-H., Chen, J.-C., & Wang, N.-S. (2011). Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times. Computers & Operations Research, 38(7), 1025–1034. https://doi.org/https://doi.org/10.1016/j.cor.2010.11.001
- Wu, C.-C., & Lee, W.-C. (2009). A note on the total completion time problem in a permutation flowshop with a learning effect. European Journal of Operational Research, 192(1), 343–347. https://doi.org/https://doi.org/10.1016/j.ejor.2007.10.003
- 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. https://doi.org/https://doi.org/10.1016/j.jmsy.2015.02.002
- Xu, Z., Sun, L., & Gong, J. (2008). Worst-case analysis for flow shop scheduling with a learning effect. International Journal of Production Economics, 113(2), 748–753. https://doi.org/https://doi.org/10.1016/j.ijpe.2007.11.002
- Xu, J., Wu, C.-C., Yin, Y., Zhao, C., Chiou, Y.-T., & Lin, W.-C. (2016). An order scheduling problem with position-based learning effect. Computers & Operations Research, 74, 175–186. https://doi.org/https://doi.org/10.1016/j.cor.2016.04.021
- Yin, Y., Liu, M., Hao, J., & Zhou, M. (2012a). Single machine scheduling with job position-dependent learning and time-dependent deterioration. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 42(1), 192–200. https://doi.org/https://doi.org/10.1109/TSMCA.2011.2147305
- Yin, Y., Wu, C.-C., Wu, W.-H., & Cheng, S.-R. (2012b). The single-machine total weighted tardiness scheduling problem with position-based learning effects. Computers & Operations Research, 39(5), 1109–1116. https://doi.org/https://doi.org/10.1016/j.cor.2011.07.022
- Yin, Y., Wu, W.-H., Wu, W.-H., & Wu, C.-C. (2014). A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Information Sciences, 256, 91–108. https://doi.org/https://doi.org/10.1016/j.ins.2013.07.026
- Yin, Y., Xu, D., Sun, K., & Li, H. (2009). Some scheduling problems with general position-dependent and time-dependent learning effects. Information Sciences, 179(14), 2416–2425. https://doi.org/https://doi.org/10.1016/j.ins.2009.02.015
- Yu, Y., & Tang, J. F. (2019). Review of seru production. Frontiers of Engineering Management, 6(2), 183–192. https://doi.org/https://doi.org/10.1007/s42524-019-0028-1
- Yu, T.-S., & Pinedo, M. (2020). Flow shops with reentry: Reversibility properties and makespan optimal schedules. European Journal of Operational Research, 282(2), 478–490. https://doi.org/https://doi.org/10.1016/j.ejor.2019.09.036
- Zhang, J., Liu, F., Tang, J., & Li, Y. (2019). The online integrated order picking and delivery considering pickers’ learning effects for an O2O community supermarket. Transportation Research Part E: Logistics and Transportation Review, 123, 180–199. https://doi.org/https://doi.org/10.1016/j.tre.2019.01.013