Multi-Task Simultaneous Supervision
Dual Resource-Constrained Scheduling Problem in Identical Parallel Machines Considering Differences in Operator Skill Levels
Keywords:
MTSSDRC scheduling, identical parallel machines, workload smoothness index, makespanAbstract
This paper focuses on developing a Multi-Task Simultaneous Supervision Dual Resource-Constrained Scheduling (MTSSDRC) system that considers differences in skill between operators, aiming to minimize makespan and balance operator workload. Workload balance is calculated using the Workload Smoothness Index (WSI). The mathematical model developed uses three techniques: Mixed-Integer Linear Programming (MILP), Mixed-Integer Quadratic Programming (MIQP), and Mixed-Integer Quadratically Constrained Programming (MIQCP). These techniques can handle scheduling cases on a small to medium scale. Results from MILP focus on minimizing makespan, with an additional constraint for calculating the WSI. MIQP focuses on workload balance so that the WSI value becomes an objective function. It also adds a constraint for the allowable makespan value. The result from MIQP shows that the WSI value is lower than in MILP, and the makespan values are equal to the MILP makespan value. Next, MIQCP aims to minimize makespan with a constraint for the allowable WSI value. The MIQCP model produces a makespan value adjusted to a WSI value close to zero. Finally, further analysis is presented regarding the influence of differences in operator skills based on the results of the three models. Based on these models, operators with better skills will be assigned more frequently than others.
References
A. Costa, F. A. Cappadonna, and S. Fichera, “A hybrid genetic algorithm for job sequencing and worker allocation in parallel unrelated machines with sequence-dependent setup times,†Int. J. Adv. Manuf. Technol., vol. 69, no. 9–12, pp. 2799–2817, 2013, doi: 10.1007/s00170-013-5221-5.
E. Vallada and R. Ruiz, “A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times,†Eur. J. Oper. Res., vol. 211, no. 3, pp. 612–622, 2011, doi: 10.1016/j.ejor.2011.01.011.
P. Baptiste, D. Rebaine, and M. Zouba, “FPTAS for the two identical parallel machine problem with a single operator under the free changing mode,†Eur. J. Oper. Res., vol. 256, no. 1, pp. 55–61, 2017, doi: 10.1016/j.ejor.2016.05.062.
O. Shahvari and R. Logendran, “A bi-objective batch processing problem with dual-resources on unrelated-parallel machines,†Appl. Soft Comput. J., vol. 61, pp. 174–192, 2017, doi: 10.1016/j.asoc.2017.08.014.
V. B. Gargeya and R. H. Deanes, “Scheduling research in multiple resource constrained job shops: A review and critique,†Int. J. Prod. Res., vol. 34, no. 8, pp. 2077–2097, 1996, doi: 10.1080/00207549608905015.
H. Elmaraghy, V. Patel, and I. Ben Abdallah, “Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms,†J. Manuf. Syst., vol. 19, no. 3, pp. 186–201, 2000, doi: 10.1016/s0278-6125(00)80011-4.
M. P. Hottenstein and S. A. Bowman, “Cross-training and worker flexibility: A review of DRC system research,†J. High Technol. Manag. Res., vol. 9, no. 2, pp. 157–174, 1998, doi: 10.1016/S1047-8310(98)90002-5.
M. Liu and X. Liu, “Satisfaction-driven bi-objective multi-skill workforce scheduling problem,†IFAC-PapersOnLine, vol. 52, no. 13, pp. 229–234, 2019, doi: 10.1016/j.ifacol.2019.11.134.
J. Li, Y. Huang, and X. Niu, “A branch population genetic algorithm for dual-resource constrained job shop scheduling problem,†Comput. Ind. Eng., vol. 102, pp. 113–131, 2016, doi: 10.1016/j.cie.2016.10.012.
A. Agnetis, M. Flamini, G. Nicosia, and A. Pacifici, “A job-shop problem with one additional resource type,†J. Sched., vol. 14, no. 3, pp. 225–237, 2011, doi: 10.1007/s10951-010-0162-4.
A. Agnetis, G. Murgia, and S. Sbrilli, “A job shop scheduling problem with human operators in handicraft production,†Int. J. Prod. Res., vol. 52, no. 13, pp. 3820–3831, 2014, doi: 10.1080/00207543.2013.831220.
R. MencÃa, M. R. Sierra, C. MencÃa, and R. Varela, “Memetic algorithms for the job shop scheduling problem with operators,†Appl. Soft Comput. J., vol. 34, pp. 94–105, 2015, doi: 10.1016/j.asoc.2015.05.004.
N. Berti, S. Finco, O. Battaïa, and X. Delorme, “Ageing workforce effects in Dual-Resource Constrained job-shop scheduling,†Int. J. Prod. Econ., vol. 237, no. May, p. 108151, 2021, doi: 10.1016/j.ijpe.2021.108151.
M. Zouba, P. Baptiste, and D. Rebaine, “Scheduling identical parallel machines and operators within a period based changing mode,†Comput. Oper. Res., vol. 36, no. 12, pp. 3231–3239, 2009, doi: 10.1016/j.cor.2009.02.022.
M. Akbar and T. Irohara, “Dual resource constrained scheduling considering operator working modes and moving in identical parallel machines using a permutation-based genetic algorithm,†IFIP Advances in Information and Communication Technology, vol. 535. pp. 464–472, 2018. doi: 10.1007/978-3-319-99704-9_57.
M. Akbar and T. Irohara, “Operator working modes and moving in identical parallel machines using a permutation-based genetic algorithm to cite this version : HAL Id : hal-02164859,†pp. 0–8, 2019.
M. Akbar and T. Irohara, “Metaheuristics for the multi-task simultaneous supervision dual resource-constrained scheduling problem,†Eng. Appl. Artif. Intell., vol. 96, no. August, p. 104004, 2020, doi: 10.1016/j.engappai.2020.104004.
M. Akbar and T. Irohara, “NSGA-II variants for solving a social-conscious dual resource-constrained scheduling problem,†Expert Syst. Appl., vol. 162, p. 113754, 2020, doi: 10.1016/j.eswa.2020.113754.
M. Akbar and T. Irohara, “A social-conscious scheduling model of dual resources constrained identical parallel machine to minimize tardiness and maximize operator productivity,†Proc. Int. Conf. Comput. Ind. Eng. CIE, vol. 2018-Decem, no. December 2018, 2018.
D. Biskup, “Single-machine scheduling with learning considerations,†Eur. J. Oper. Res., vol. 115, no. 1, pp. 173–178, 1999, doi: 10.1016/S0377-2217(98)00246-X.
J. Xu, X. Xu, and S. Q. Xie, “Recent developments in Dual Resource Constrained (DRC) system research,†Eur. J. Oper. Res., vol. 215, no. 2, pp. 309–318, 2011, doi: 10.1016/j.ejor.2011.03.004.
W. H. Kuo and D. L. Yang, “Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect,†Eur. J. Oper. Res., vol. 174, no. 2, pp. 1184–1190, 2006, doi: 10.1016/j.ejor.2005.03.020.
R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, “Optimization and heuristic in deterministic sequencing and scheduling: a survey,†Ann. Discret. Math., vol. 5, pp. 287–326, 1979, [Online]. Available: https://ac.els-cdn.com/S016750600870356X/1-s2.0-S016750600870356X-main.pdf?_tid=cbf345a3-808d-42df-9560-bf8a52069d0e&acdnat=1550949881_e9837bfdf6316caefaf71ae2f3779b10
P. C. Hu, “Minimising total tardiness for the worker assignment scheduling problem in identical parallel-machine models,†Int. J. Adv. Manuf. Technol., vol. 23, no. 5–6, pp. 383–388, 2004, doi: 10.1007/s00170-003-1716-9.
P. C. Hu, “Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models,†Int. J. Adv. Manuf. Technol., vol. 25, no. 9–10, pp. 1046–1052, 2005, doi: 10.1007/s00170-003-1989-z.
E. B. Edis, C. Oguz, and I. Ozkarahan, “Parallel machine scheduling with additional resources: Notation, classification, models and solution methods,†Eur. J. Oper. Res., vol. 230, no. 3, pp. 449–463, 2013, doi: 10.1016/j.ejor.2013.02.042.
F. Pulansari and T. D. R. M., “The unrelated parallel machine scheduling with a dependent time setup using ant colony optimization algorithm,†Jurnal Teknik Industi: Jurnal Keilmuan dan Aplikasi Teknik Industri, vol. 23, no. 1, pp. 65–74, 2021, doi: 10.9744/jti.23.1.65-74.
D. Biskup, J. Herrmann, and J. N. D. Gupta, “Scheduling identical parallel machines to minimize total tardiness,†Int. J. Prod. Econ., vol. 115, no. 1, pp. 134–142, 2008, doi: 10.1016/j.ijpe.2008.04.011.
K. R. Baker and D. Trietsch, Principles of Sequencing and Scheduling Second Edition, vol. 21, no. 1. 2019. [Online]. Available: http://journal.um-surabaya.ac.id/index.php/JKM/article/view/2203
H. Suwa and H. Sandoh, Online scheduling in manufacturing: A cumulative delay approach, vol. 9781447145. 2013. doi: 10.1007/978-1-4471-4561-5.
M. . Pinedo, Scheduling Theory, Algorithms, and Systems. New York: Springer US, 2012. doi: 10.1007/978-1-4614-2361-4.
L. Zhang, Q. Deng, R. Lin, G. Gong, and W. Han, “A combinatorial evolutionary algorithm for unrelated parallel machine scheduling problem with sequence and machine-dependent setup times, limited worker resources and learning effect,†Expert Syst. Appl., vol. 175, no. 2, p. 114843, 2021, doi: 10.1016/j.eswa.2021.114843.
L. Munoz, J. R. Villalobos, and J. W. Fowler, “Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times,†Comput. Oper. Res., vol. 143, no. March, p. 105787, 2022, doi: 10.1016/j.cor.2022.105787.
L. Gao and Q. K. Pan, “A shuffled multi-swarm micro-migrating birds optimizer for a multi-resource-constrained flexible job shop scheduling problem,†Inf. Sci. (Ny)., vol. 372, pp. 655–676, 2016, doi: 10.1016/j.ins.2016.08.046.
J. E. C. Arroyo and J. Y. T. Leung, “Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times,†Comput. Oper. Res., vol. 78, pp. 117–128, 2017, doi: 10.1016/j.cor.2016.08.015.
Z. Peng, H. Zhang, H. Tang, Y. Feng, and W. Yin, “Research on flexible job-shop scheduling problem in green sustainable manufacturing based on learning effect,†J. Intell. Manuf., vol. 33, no. 6, pp. 1725–1746, 2022, doi: 10.1007/s10845-020-01713-8.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Afifah Rizka, Sukoyo, Muhammad Akbar
This work is licensed under a Creative Commons Attribution 4.0 International License.
Articles published in the Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri will be Open-Access articles distributed under the terms and conditions of the Creative Commons Attribution License (CC BY).
This work is licensed under a  Creative Commons Attribution License (CC BY).
