A good balance for an online scheduling problem considering both learning and deteriorating effects in the handicraft process

References

• Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society, 50(7), 711–720. https://doi.org/10.1057/palgrave.jors.2600740
   Web of Science ®Google Scholar
• Bai, D. Y., Tang, M. Q., 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/10.1016/j.omega.2017.10.002
   Web of Science ®Google Scholar
• Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115(1), 173–178. https://doi.org/10.1016/S0377-2217(98)00246-X
   Web of Science ®Google Scholar
• Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38(3), 495–498. https://doi.org/10.1287/opre.38.3.495
   Web of Science ®Google Scholar
• Chai, X., Li, W. H., Yuan, H., & Wang, L. B. (2022). Online scheduling on a single machine with linear deteriorating processing times and delivery times. Journal of Combinatorial Optimization, 44(3), 1900–1912. https://doi.org/10.1007/s10878-020-00557-5
   Web of Science ®Google Scholar
• Cheng, B. Y., Leung, J. Y. T., Li, K., & Yang, S. L. (2019). Integrated optimization of material supplying, manufacturing, and product distribution: Models and fast algorithms. European Journal of Operational Research, 277(1), 100–111. https://doi.org/10.1016/j.ejor.2019.02.024
   Web of Science ®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), 1–13. https://doi.org/10.1016/S0377-2217(02)00909-8
   Web of Science ®Google Scholar
• De Matta, R. (2018). Scheduling a manufacturing process with restrictions on resource availability. International Journal of Production Research, 56(19), 6412–6429. https://doi.org/10.1080/00207543.2017.1384583
   Web of Science ®Google Scholar
• Fox, K., Im, S., & Moseley, B. (2018). Energy efficient scheduling of parallelizable jobs. Theoretical Computer Science, 726, 30–40. https://doi.org/10.1016/j.tcs.2018.02.021
   Web of Science ®Google Scholar
• Gawiejnowicz, S., & Kononov, A. (2010). Complexity and approximability of scheduling resumable proportionally deteriorating jobs. European Journal of Operational Research, 200(1), 305–308. https://doi.org/10.1016/j.ejor.2008.12.014
   Web of Science ®Google Scholar
• Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5(1), 287–326.
   Google Scholar
• Gribkovskaia, I., Halskau, O., & Kovalyov, M. Y. (2015). Minimizing takeoff and landing risk in helicopter pickup and delivery operations. Omega: The International Journal of Management Science, 55, 73–80. https://doi.org/10.1016/j.omega.2015.02.010
   Web of Science ®Google Scholar
• Gupta, J. N. D., & Gupta, S. K. (1988). Single facility scheduling with nonlinear processing times. Computers & Industrial Engineering, 14(4), 387–393. https://doi.org/10.1016/0360-8352(88)90041-1
   Web of Science ®Google Scholar
• Hoogeveen, J. A., & Vestjens, A. P. A. (1996). Optimal on-line algorithms for single-machine scheduling. In International Conference on Integer Programming & Combinatorial Optimization.
   Google Scholar
• Kuo, W. H., & Yang, D. L. (2011). A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects. Journal of the Operational Research Society, 62(1), 206–210. https://doi.org/10.1057/jors.2009.155
   Web of Science ®Google Scholar
• Lee, W. C. (2004). A note on deteriorating jobs and learning in single-machine scheduling problems. International Journal of Business and Economics, 3(1), 83–89.
   Google Scholar
• Li, S. S., Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2011). Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. European Journal of Operational Research, 210(3), 482–488. https://doi.org/10.1016/j.ejor.2010.11.021
   Web of Science ®Google Scholar
• Li, W. H., Wang, L. B., Chai, X., & Yuan, H. (2020). Online batch scheduling of simple linear deteriorating jobs with incompatible families. Mathematics, 8(2), 170. https://doi.org/10.3390/math8020170
   Web of Science ®Google Scholar
• Liu, M., Zheng, F. F., Wang, S. J., & Huo, J. Z. (2012). Optimal algorithms for online single machine scheduling with deteriorating jobs. Theoretical Computer Science, 445, 75–81. https://doi.org/10.1016/j.tcs.2012.05.004
   Web of Science ®Google Scholar
• Liu, P. H., & Lu, X. W. (2009). On-line scheduling of parallel machines to minimize total completion times. Computers & Operations Research, 36(9), 2647–2652. https://doi.org/10.1016/j.cor.2008.11.008
   Web of Science ®Google Scholar
• Ma, R., & Guo, S. N. (2021). Applying “peeling onion” approach for competitive analysis in online scheduling with rejection. European Journal of Operational Research, 290(1), 57–67. https://doi.org/10.1016/j.ejor.2020.08.009
   Web of Science ®Google Scholar
• Ma, R., Guo, S. N., & Zhang, X. Y. (2022). An optimal online algorithm for single-processor scheduling problem with learning effect. Theoretical Computer Science, 928, 1–12. https://doi.org/10.1016/j.tcs.2022.06.006
   Web of Science ®Google Scholar
• Ma, R., Tao, J. P., & Yuan, J. J. (2016). Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. Applied Mathematics and Computation, 273, 570–583. https://doi.org/10.1016/j.amc.2015.10.058
   Web of Science ®Google Scholar
• Menezes, G. C., Mateus, G. R., & Ravetti, M. G. (2016). A hierarchical approach to solve a production planning and scheduling problem in bulk cargo terminal. Computers & Industrial Engineering, 97, 1–14. https://doi.org/10.1016/j.cie.2016.04.007
   Web of Science ®Google Scholar
• Mohammadi, S., Al-E-Hashem, S. M. J. M., & Rekik, Y. (2020). An integrated production scheduling and delivery route planning with multi-purpose machines: A case study from a furniture manufacturing company. International Journal of Production Economics, 219, 347–359. https://doi.org/10.1016/j.ijpe.2019.05.017
   Web of Science ®Google Scholar
• Mosquera, F., Smet, P., & Vanden Berghe, G. (2019). Flexible home care scheduling. Omega, 83, 80–95. https://doi.org/10.1016/j.omega.2018.02.005
   Web of Science ®Google Scholar
• Muştu, S., & Eren, T. (2021). The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects. Optimization Letters, 15(4), 1327–1343. https://doi.org/10.1007/s11590-020-01641-9
   Web of Science ®Google Scholar
• Touafek, N., Ladj, A., Tayeb, F. B. S., Dahamni, A., & Baghdadi, R. (2022). Permutation flowshop scheduling problem considering learning, deteriorating effects and flexible maintenance. Procedia Computer Science, 207, 2518–2525. https://doi.org/10.1016/j.procs.2022.09.310
   Google Scholar
• Wang, J. B. (2007). Single-machine scheduling problems with the effects of learning and deterioration. Omega, 35(4), 397–402. https://doi.org/10.1016/j.omega.2005.07.008
   Web of Science ®Google Scholar
• Wright, T. P. (1936). Factors affecting the cost of airplanes. Journal of the Aeronautical Sciences, 3(4), 122–128. https://doi.org/10.2514/8.155
   Google Scholar
• Zhang, C. T., Gao, Y., Yang, L. X., Kumar, U., & Gao, Z. Y. (2019). Integrated optimization of train scheduling and maintenance planning on high-speed railway corridors. Omega, 87, 86–104. https://doi.org/10.1016/j.omega.2018.08.005
   Web of Science ®Google Scholar