In this paper, we address single-machine scheduling with sum of logarithm processing times-based learning effect. Under exponential past-sequence-dependent delivery times, we proved that the makespan and total completion time minimizations can be solved by the smallest processing time (SPT) first rule. Under the agreeable weight condition and agreeable due date condition, we show that the total weighted completion time minimization and maximum tardiness minimization can be solved in polynomial time, respectively.

Keywords:

References

Azzouz, A, M Ennigrou and LB Said (2018). Scheduling problems under learning effects: Classification and cartography. International Journal of Production Research, 56, 1642–1661. Crossref, 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. Crossref, Web of Science, Google Scholar
Cheng, TCE, P Lai, C-C Wu and W Lee (2009). Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Information Sciences, 179, 3127–3135. Crossref, Web of Science, Google Scholar
Cheng, TCE, C-C Wu, J-C Chen, W-H Wu and S-R Cheng (2013). Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. International Journal of Production Economics, 141, 79–86. Crossref, Web of Science, Google Scholar
Jia, X, D-Y Lv, Y Hu, J-B Wang, Z Wang and E Wang (2022). Slack due-window assignment scheduling problem with deterioration effects and a deteriorating maintenance activity. Asia-Pacific Journal of Operational Research, 39(6), 2250005. Link, Web of Science, Google Scholar
Koulamas, C and GJ Kyparisis (2010). Single-machine scheduling problems with past-sequence-dependent delivery times. International Journal of Production Economics, 126, 264–266. Crossref, Web of Science, Google Scholar
Kubzin, MA and VA Strusevich (2006). Planning machine maintenance in two-machine shop scheduling. Operations Research, 54, 789–800. Crossref, Web of Science, Google Scholar
Liu, W-W and C Jiang (2020). Flow shop resource allocation scheduling with due date assignment, learning effect and position-dependent weights. Asia-Pacific Journal of Operational Research, 37, 2050014. Link, Web of Science, Google Scholar
Lu, Y-Y, G Li, Y-B Wu and P Ji (2014). Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optimization Letters, 8, 113–127. Crossref, Web of Science, Google Scholar
Lu, Y-Y, F Teng and Z-X Feng (2015). Scheduling jobs with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects. Asia-Pacific Journal of Operational Research, 32(3), 1550026. Link, Web of Science, Google Scholar
Lv, D-Y and J-B Wang (2021). Study on resource-dependent no-wait flow shop scheduling with different due-window assignment and learning effects. Asia-Pacific Journal of Operational Research, 38(6), 2150008. Link, Web of Science, Google Scholar
Qian, J and H Han (2022). The due date assignment scheduling problem with the deteriorating jobs and delivery time. Journal of Applied Mathematics and Computing, 68, 2173–2186. Crossref, Web of Science, Google Scholar
Qian, J and Y Zhan (2021). The due date assignment scheduling problem with delivery times and truncated sum-of-processing-times-based learning effect. Mathematics, 9, 3085–3098. Crossref, Web of Science, Google Scholar
Strusevich, VA and K Rustogi (2017). Scheduling with Time-Changing Effects and Rate-Modifying Activities. Berlin: Springer-Verlag. Crossref, Google Scholar
Sun, X, X-N Geng and F Liu (2021). Flow shop scheduling with general position weighted learning effectsto minimise total weighted completion time. Journal of the Operational Research Society, 72(12), 2674–2689. Crossref, Web of Science, Google Scholar
Toksari, MD, EK Aydogan, B Atalay and S Sari (2022). Some scheduling problems with sum of logarithm processing times based learning effect and exponential past sequence dependent delivery times. Journal of Industrial and Management Optimization, 18(3), 1795–1807. Crossref, Web of Science, Google Scholar
Wang, J-B, B Cui, P Ji and W-W Liu (2021). Research on scheduling with position-dependent weights and past-sequence-dependent delivery times. Journal of Combinatorial Optimization, 41(2), 290–303. Crossref, Web of Science, Google Scholar
Wang, S-H, D-Y Lv and J-B Wang (2023). Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect. Journal of Industrial and Management Optimization, 19(4), 2824–2837. Crossref, Web of Science, Google Scholar
Wang, J-B, J Xue, B Cui and M Gao (2022). Single-machine scheduling problems with variable processing times and past-sequence-dependent delivery times. Asia-Pacific Journal of Operational Research, 39(2), 2150013. Link, Web of Science, Google Scholar
Wang, DJ, YQ Yin and TCE Cheng (2017). A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times. Naval Research Logistics, 64(1), 41–63. Crossref, Web of Science, Google Scholar
Wang, J-B, B Zhang, L Li, D Bai and Y-B Feng (2020). Due window assignment scheduling problems with position-dependent weights on a single machine. Engineering Optimization, 52(2), 185–193. Crossref, Web of Science, Google Scholar
Yan, J-X, N Ren, H-B Bei, H Bao and J-B Wang (2023). Study on resource allocation scheduling problem with learning factors and group technology. Journal of Industrial and Management Optimization, 19(5), 3419–3435. Crossref, Web of Science, Google Scholar
Zhao, S (2021). Resource allocation flowshop scheduling with learning effect and slack due window assignment. Journal of Industrial and Management Optimization, 17(5), 2817–2835. Crossref, Web of Science, Google Scholar
Zhao, S (2022). Scheduling jobs with general truncated learning effects including proportional setup times. Computational and Applied Mathematics, 41, 146. Crossref, Web of Science, Google Scholar