Scheduling controllable processing time jobs in seru production system with resource allocation

References

• Akhoondi, F., & Lotfi, M. M. (2016). A heuristic algorithm for master production scheduling problem with controllable processing times and scenario-based demands. International Journal of Production Research, 54(12), 3659–3676. https://doi.org/10.1080/00207543.2015.1125032
   Web of Science ®Google Scholar
• Akino, S. (1997). Internationalization of Japanese company and change of production system. Rikkyo Economic Review, 51(1), 29–55. (in Japanese)
   Google Scholar
• Alidaee, B., & Ahmadian, A. (1993). Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research, 70(3), 335–341. https://doi.org/10.1016/0377-2217(93)90245-I
   Web of Science ®Google Scholar
• Alidaee, B., & Kochenberger, G. (2009). A framework for machine scheduling problems with controllable processing times. Production and Operations Management, 5(4), 391–405. https://doi.org/10.1111/j.1937-5956.1996.tb00407.x
   Google Scholar
• Alidaee, B., Li, H., Wang, H., & Womer, K. (2021). Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension. Omega, 103, 102446. https://doi.org/10.1016/j.omega.2021.102446
   Web of Science ®Google Scholar
• Alidaee, B., Wang, H., Kethley, R. B., & Landram, F. (2019). A unified view of parallel machine scheduling with interdependent processing rates. Journal of Scheduling, 22(5), 499–515. https://doi.org/10.1007/s10951-019-00605-x
   Web of Science ®Google Scholar
• Chao, L., Li, X., Liang, G., Wei, L., & Jin, Y. (2017). An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times. Computers & Industrial Engineering, 104, 156–174.
   Web of Science ®Google Scholar
• Chen, Z. L. (2004). Simultaneous job scheduling and resource allocation on parallel machines. Annals of Operations Research, 129(1–4), 135–153. https://doi.org/10.1023/B:ANOR.0000030685.31167.11
   Web of Science ®Google Scholar
• Chen, Z. L., Lu, Q., & Tang, G. C. (1997). Single machine scheduling with discretely controllable processing times. Operations Research Letters, 21(2), 69–76. https://doi.org/10.1016/S0167-6377(97)00010-2
   Web of Science ®Google Scholar
• Daniels, R. L., Hoopes, B. J., & Mazzola, J. B. (1996). Scheduling parallel manufacturing cells with resource flexibility. Management Science, 42(9), 1260–1276. https://doi.org/10.1287/mnsc.42.9.1260
   Web of Science ®Google Scholar
• Daniels, R. L., Hoopes, B. J., & Mazzola, J. B. (1997). An analysis of heuristics for the parallel-machine flexible-resource scheduling problem. Annals of Operations Research, 70(1–4), 439–472. https://doi.org/10.1023/A:1018946810121
   Web of Science ®Google Scholar
• Daniels, R. L., Hua, S. Y., & Webster, S. (1999). Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job. Computers & Operations Research, 26(2), 143–155. https://doi.org/10.1016/S0305-0548(98)00054-9
   Web of Science ®Google Scholar
• Daniels, R. L., & Mazzola, J. B. (1994). Flow shop scheduling with resource flexibility. Operations Research, 42(3), 504–522. https://doi.org/10.1287/opre.42.3.504
   Web of Science ®Google Scholar
• Gao, J., Zhu, X., Bai, K., & Zhang, R. (2021). New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem. International Journal of Production Research inpress, 10.1080/00207543.2021.1886368
   PubMed Web of Science ®Google Scholar
• Graham, R., Lawler, E., Lenstra, J., & Rinnooy, K. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.
   Google Scholar
• Grigoriev, A., Sviridenko, M., & Uetz, M. J. (2005). Machine scheduling with resource dependent processing times. Mathematical Programming: Series A and B, 110, 414–419.
   Web of Science ®Google Scholar
• Hsieh, P. H., Yang, S. J., & Yang, D. L. (2015). Decision support for unrelated parallel machine scheduling with discrete controllable processing times. Applied Soft Computing, 30, 475–483. https://doi.org/10.1016/j.asoc.2015.01.028
   Web of Science ®Google Scholar
• Jansen, K., Mastrolilli, M., & Solis-Oba, R. (2005). Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research, 167(2), 297–319. https://doi.org/10.1016/j.ejor.2004.03.025
   Web of Science ®Google Scholar
• Kaku, I., Gong, J., Tang, J. F., & Yin, Y. (2009). Modeling and numerical analysis of line-cell conversion problems. International Journal of Production Research, 47(8), 2055–2078. https://doi.org/10.1080/00207540802275889
   Web of Science ®Google Scholar
• Koca, E., Yaman, H., & Akturk, M. S. (2015). Stochastic lot sizing problem with controllable processing times. Omega, 53(6), 1–10. https://doi.org/10.1016/j.omega.2014.11.003
   Web of Science ®Google Scholar
• Lee, H. T., Yang, D. L., & Yang, S. J. (2013). Multi-machine scheduling with deterioration effects and maintenance activities for minimizing the total earliness and tardiness costs. The International Journal of Advanced Manufacturing Technology, 66(1–4), 547–554. https://doi.org/10.1007/s00170-012-4348-0
   Web of Science ®Google Scholar
• Lian, J., Liu, C. G., Li, W. J., & Yin, Y. (2018). A multi-skilled worker assignment in seru production systems considering worker heterogeneity. Computers & Industrial Engineering, 118, 366–382. https://doi.org/10.1016/j.cie.2018.02.035
   Web of Science ®Google Scholar
• Liu, C. G., Lian, J., Yin, Y., & Li, W. J. (2010). Seru seisan-an innovation of the production management mode in Japan. Asian Journal of Technology Innovation, 18(2), 89–113. https://doi.org/10.1080/19761597.2010.9668694
   Web of Science ®Google Scholar
• Liu, C. G., Stecke, K. E., Lian, J., & Yin, Y. (2014). An implementation framework for seru production. International Transactions in Operational Research, 21(1), 1–19. https://doi.org/10.1111/itor.12014
   Web of Science ®Google Scholar
• Liu, C. H., & Tsai, W. N. (2016). Multi-objective parallel machine scheduling problems by considering controllable processing times. Journal of the Operational Research Society, 67(4), 654–663. https://doi.org/10.1057/jors.2015.82
   Web of Science ®Google Scholar
• Luo, L., Zhang, Z., & Yin, Y. (2017). Modelling and numerical analysis of seru loading problem under uncertainty. European J. of Industrial Engineering, 11(2), 185–204. https://doi.org/10.1504/EJIE.2017.083255
   Web of Science ®Google Scholar
• Mosheiov, G. (2008). Minimizing total absolute deviation of job completion times: Extensions to position-dependent processing times and parallel identical machines. Journal of the Operational Research Society, 59(10), 1422–1424. https://doi.org/10.1057/palgrave.jors.2602480
   Web of Science ®Google Scholar
• Nowicki, E., & Zdrzałka, S. (1990). A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics, 26(2–3), 271–287. https://doi.org/10.1016/0166-218X(90)90105-L
   Web of Science ®Google Scholar
• Oron, D. (2014). Scheduling controllable processing time jobs in a deteriorating environment. Journal of the Operational Research Society, 65(1), 49–56. https://doi.org/10.1057/jors.2013.5
   Web of Science ®Google Scholar
• Panwalkar, S. S., & Rajagopalan, R. (1992). Single-machine sequencing with controllable processing times. European Journal of Operational Research, 59(2), 298–302. https://doi.org/10.1016/0377-2217(92)90144-X
   Web of Science ®Google Scholar
• Panwalkar, S. S., Smith, M. L., & Seidmann, A. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30(2), 391–399. https://doi.org/10.1287/opre.30.2.391
   Web of Science ®Google Scholar
• Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: Algorithms and complexity. IEEE Transactions on Acoustics Speech & Signal Processing, 32(6), 1258–1259.
   Google Scholar
• Rudek, R., & Rudek, A. (2012). On flowshop scheduling problems with the aging effect and resource allocation. The International Journal of Advanced Manufacturing Technology, 62(1–4), 135–145. https://doi.org/10.1007/s00170-011-3809-1
   Web of Science ®Google Scholar
• Sakazume, Y. (2005). Is Japanese cell manufacturing a new system? A comparative study between Japanese cell manufacturing and cell manufacturing. Journal of Japan Industrial Management Association, 12, 89–94.
   Google Scholar
• Shabtay, D. (2004). Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine. Computers & Operations Research, 31(8), 1303–1315. https://doi.org/10.1016/S0305-0548(03)00081-9
   Web of Science ®Google Scholar
• Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643–1666. https://doi.org/10.1016/j.dam.2007.02.003
   Web of Science ®Google Scholar
• Shabtay, D., & Zofi, M. (2018). Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan. International Journal of Production Economics, 198, 191–200. https://doi.org/10.1016/j.ijpe.2017.12.025
   Web of Science ®Google Scholar
• Shin, J. H., Yu, J. M., Doh, H. H., Kim, H. W., & Lee, D. H. (2020). Batching and scheduling for a single-machine flexible machining cell with multi-fixturing pallets and controllable processing times. International Journal of Production Research, 58(3), 863–877. https://doi.org/10.1080/00207543.2019.1602742
   Web of Science ®Google Scholar
• Shioura, A., Shakhlevich, N. V., & Strusevich, V. A. (2018). Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. European Journal of Operational Research, 266(3), 795–818. https://doi.org/10.1016/j.ejor.2017.08.034
   Web of Science ®Google Scholar
• Stecke, K. E., Yin, Y., Kaku, I., & Murase, Y. (2012). Seru: The organizational extension of JIT for a super-talent factory. International Journal of Strategic Decision Sciences, 3(1), 106–118. https://doi.org/10.4018/jsds.2012010104
   Google Scholar
• Tunc, H. (2021). A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times. Computers & Operations Research, 132, 105302. https://doi.org/10.1016/j.cor.2021.105302
   Web of Science ®Google Scholar
• Van Wassenhove, L. N., & Baker, K. R. (1982). A bicriterion approach to time/cost trade-offs in sequencing. European Journal of Operational Research, 11(1), 48–52. https://doi.org/10.1016/S0377-2217(82)80008-8
   Web of Science ®Google Scholar
• Vickson, R. G. (1980a). Choosing the job sequence and processing times to minimize processing plus flow cost on a single machine. Operations Research, 28(5), 1155–1167. https://doi.org/10.1287/opre.28.5.1155
   Web of Science ®Google Scholar
• Vickson, R. G. (1980b). Two single-machine sequencing problems involving controllable job processing times. A I I E Transactions, 12(3), 258–262. https://doi.org/10.1080/05695558008974515
   Web of Science ®Google Scholar
• Wang, L., Zhang, Z., Yin, Y. (2019). Order acceptance and scheduling considering lot-spitting in seru production system. 2019 IEEE International Conference on Industrial Engineering and Engineering Management (pp. 1305–1309). IEEE.
   Google Scholar
• Wang, Y., & Tang, J. F. (2018). Cost and service-level-based model for a seru production system formation problem with uncertain demand. Journal of Systems Science and Systems Engineering, 27(4), 519–537. https://doi.org/10.1007/s11518-018-5379-3
   Web of Science ®Google Scholar
• Wang, Y. L., Zhang, Z., & Yin, Y. (2020). Workload-based order acceptance in seru production system. International Journal of Manufacturing Research, 15(3), 234–251. https://doi.org/10.1504/IJMR.2020.108197
   Google Scholar
• Wu, Y., Wang, L., & Chen, J. F. (2021). A cooperative coevolution algorithm for complex hybrid seru-system scheduling optimization. Complex & Intelligent Systems, 7(5), 2559–2576. https://doi.org/10.1007/s40747-021-00432-8
   Web of Science ®Google Scholar
• Yamada, H. (2009). Waste reduction (Muda Tori, in Japanese). Gentosha.
   Google Scholar
• Yang, D. L., Cheng, T. C. E., & Yang, S. J. (2014). Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions. International Journal of Production Research, 52(4), 1133–1141. https://doi.org/10.1080/00207543.2013.841330
   Web of Science ®Google Scholar
• Yang, D. L., Lee, H. T., & Yang, S. J. (2012). Unrelated parallel-machine scheduling simultaneously with rate-modifying activities and earliness and tardiness penalties. Journal of the Chinese Institute of Engineers, 29, 282–289.
   Google Scholar
• Yang, S. J., Yang, D. L., & Hsu, C. J. (2010). Single-machine scheduling with due-date assignment and aging effect under a deteriorating maintenance activity consideration. International Journal of Information and Management Sciences, 21, 177–195.
   Google Scholar
• Yılmaz, Ö. F. (2020a). Operational strategies for seru production system: A bi-objective optimisation model and solution methods. International Journal of Production Research, 58(11), 3195–3219. https://doi.org/10.1080/00207543.2019.1669841
   Web of Science ®Google Scholar
• Yılmaz, Ö. F. (2020b). Attaining flexibility in seru production system by means of Shojinka: An optimization model and solution approaches. Computers & Operations Research, 119, 104917. https://doi.org/10.1016/j.cor.2020.104917
   Web of Science ®Google Scholar
• Yılmaz, Ö. F., Cevikcan, E., & Durmusoglu, M. B. (2016). Scheduling batches in multi hybrid cell manufacturing system considering worker resources: A case study from pipeline industry. Advances in Production Engineering & Management, 11(3), 192–206. https://doi.org/10.14743/apem2016.3.220
   Web of Science ®Google Scholar
• Yılmaz, Ö. F., & Durmusoglu, M. B. (2019). Multi-objective scheduling problem for hybrid manufacturing systems with walking workers. International Journal of Industrial Engineering: Theory, Applications and Practice, 26(5), 625–650.
   Web of Science ®Google Scholar
• Yin, Y., Stecke, K. E., & Li, D. N. (2018). The evolution of production systems from Industry 2.0 through Industry 4.0. International Journal of Production Research, 56(1–2), 848–861. https://doi.org/10.1080/00207543.2017.1403664
   Web of Science ®Google Scholar
• Yin, Y., Stecke, K. E., Swink, M., & Kaku, I. (2017). Lessons from seru production on manufacturing competitively in a high cost environment. Journal of Operations Management, 49–51(1), 67–76. https://doi.org/10.1016/j.jom.2017.01.003
   Web of Science ®Google Scholar
• Ying, K. C., & Tsai, Y. J. (2017). Minimising total cost for training and assigning multiskilled workers in seru production systems. International Journal of Production Research, 55(10), 2978–2989. https://doi.org/10.1080/00207543.2016.1277594
   Web of Science ®Google Scholar
• Yu, Y., Sun, W., Tang, J. F., Kaku, I., & Wang, J. (2017). Line-seru conversion towards reducing worker(s) without increasing makespan: Models, exact and meta-heuristic solutions. International Journal of Production Research, 55(10), 2990–3007. https://doi.org/10.1080/00207543.2017.1284359
   Web of Science ®Google Scholar
• Yu, Y., & Tang, J. (2018). Seru production mode. Science Press. (in Chinese)
   Google Scholar
• Yu, Y., & Tang, J. (2019). Review of seru production. Frontiers of Engineering Management, 6(2), 183–192. https://doi.org/10.1007/s42524-019-0028-1
   Web of Science ®Google Scholar
• Zhang, Z., Song, X., Huang, H., Zhou, X., & Yin, Y. (2021a). Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect. European Journal of Operational Research, inpress, https://doi.org/10.1016/j.ejor.2021.06.017.
   Web of Science ®Google Scholar
• Zhang, Z., Wang, L., Song, X., Huang, H., & Yin, Y. (2021b). Improved genetic-simulated annealing algorithm for seru loading problem with downward substitution under stochastic environment. Journal of the Operational Research Society, inpress, https://doi.org/10.1080/01605682.2021.1939172.
   Web of Science ®Google Scholar
• Zhou, F., He, Y., Ma, P., Lim, M., & Pratap, S. (2021). Capacitated disassembly scheduling with random demand and operation time. Journal of the Operational Research Society, inpress, https://doi.org/10.1080/01605682.2021.1911603.
   Web of Science ®Google Scholar