{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T22:05:18Z","timestamp":1766181918990,"version":"3.41.2"},"reference-count":75,"publisher":"Emerald","issue":"8","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IMDS"],"published-print":{"date-parts":[[2022,8,16]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>Cycle time reduction is important for order fulling process but often subject to resource constraints. This study considers an unrelated parallel machine environment where orders with random demands arrive dynamically. Processing speeds are controlled by resource allocation and subject to diminishing marginal returns. The objective is to minimize long-run expected order cycle time via order schedule and resource allocation decisions.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>A stochastic optimization algorithm named CAP is proposed based on particle swarm optimization framework. It takes advantage of derived bound information to improve local search efficiency. Parameter impacts including demand variance, product type number, machine speed and resource coefficient are also analyzed through theoretic studies. The algorithm is evaluated and benchmarked with four well-known algorithms via extensive numerical experiments.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>First, cycle time can be significantly improved when demand randomness is reduced via better forecasting. Second, achieving processing balance should be of top priority when considering resource allocation. Third, given marginal returns on resource consumption, it is advisable to allocate more resources to resource-sensitive machines.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>A novel PSO-based optimization algorithm is proposed to jointly optimize order schedule and resource allocation decisions in a dynamic environment with random demands and stochastic arrivals. A general quadratic resource consumption function is adopted to better capture diminishing marginal returns.<\/jats:p><\/jats:sec>","DOI":"10.1108\/imds-02-2022-0105","type":"journal-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T01:06:37Z","timestamp":1658106397000},"page":"1882-1908","source":"Crossref","is-referenced-by-count":5,"title":["Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information"],"prefix":"10.1108","volume":"122","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2971-2509","authenticated-orcid":false,"given":"Yaping","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2567-4856","authenticated-orcid":false,"given":"Xiangtianrui","family":"Kong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1783-0006","authenticated-orcid":false,"given":"Xiaoyun","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0947-5948","authenticated-orcid":false,"given":"Endong","family":"Xu","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"issue":"2","key":"key2022081609032947100_ref001","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10845-015-1117-6","article-title":"Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions","volume":"29","year":"2018","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"6","key":"key2022081609032947100_ref002","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/nav.20092","article-title":"Coordinated scheduling of customer orders for quick response","volume":"52","year":"2005","journal-title":"Naval Research Logistics (NRL)"},{"issue":"1","key":"key2022081609032947100_ref003","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10951-009-0111-2","article-title":"Parallel machine match-up scheduling with manufacturing cost considerations","volume":"13","year":"2010","journal-title":"Journal of Scheduling"},{"issue":"5","key":"key2022081609032947100_ref004","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.jksues.2019.03.006","article-title":"Tabu search and particle swarm optimization algorithms for two identical parallel machines scheduling problem with a single server","volume":"32","year":"2020","journal-title":"Journal of King Saud University-Engineering Sciences"},{"key":"key2022081609032947100_ref005","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(93)90245-I","article-title":"Two parallel machine sequencing problems involving controllable job processing times","volume":"70","year":"1993","journal-title":"European Journal of Operational Research"},{"issue":"5-8","key":"key2022081609032947100_ref006","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1007\/s00170-014-6181-0","article-title":"Particle swarm optimization-based algorithm for fuzzy parallel machine scheduling","volume":"75","year":"2014","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"4","key":"key2022081609032947100_ref007","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1287\/mnsc.27.4.431","article-title":"Disaggregation and resource allocation using convex knapsack problems with bounded variables","volume":"27","year":"1981","journal-title":"Management Science"},{"issue":"1","key":"key2022081609032947100_ref008","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","article-title":"Resource-constrained project scheduling: notation, classification, models, and methods","volume":"112","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"key2022081609032947100_ref009","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/j.procir.2013.09.077","article-title":"Makespan minimization of unrelated parallel machines with limited human resources","volume":"12","year":"2013","journal-title":"Procedia Cirp"},{"first-page":"252","article-title":"A hybrid particle swarm optimization algorithm for parallel batch processing machines scheduling","year":"2013","key":"key2022081609032947100_ref010"},{"issue":"3","key":"key2022081609032947100_ref011","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s00170-003-1622-1","article-title":"Unrelated parallel machine scheduling with secondary resource constraints","volume":"26","year":"2005","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"key2022081609032947100_ref012","first-page":"81","article-title":"Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints","volume":"34","year":"2006","journal-title":"Omega-international Journal of Management Science"},{"issue":"2","key":"key2022081609032947100_ref013","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/07408179608966263","article-title":"Parallel-machine scheduling with controllable processing times","volume":"28","year":"1996","journal-title":"IIE Transactions"},{"issue":"9","key":"key2022081609032947100_ref014","first-page":"1131","article-title":"A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines","volume":"58","year":"2012","journal-title":"International Journal of Advanced Manufacturing Technology"},{"volume-title":"Multi-Objective Swarm Intelligence: Theoretical Advances and Applications","year":"2015","key":"key2022081609032947100_ref015"},{"first-page":"39","article-title":"A new optimizer using particle swarm theory","year":"1995","key":"key2022081609032947100_ref016"},{"issue":"3","key":"key2022081609032947100_ref017","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.ejor.2013.02.042","article-title":"Parallel machine scheduling with additional resources: notation, classification, models and solution methods","volume":"230","year":"2013","journal-title":"European Journal of Operational Research"},{"issue":"5-8","key":"key2022081609032947100_ref018","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1007\/s00170-012-4064-9","article-title":"From time-based competition to quick response manufacturing: the evolution of research aimed at lead time reduction","volume":"64","year":"2013","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"key2022081609032947100_ref019","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10107-006-0059-3","article-title":"Unrelated parallel machine scheduling with resource dependent processing times","volume":"110","year":"2007","journal-title":"Mathematical Programming"},{"issue":"1","key":"key2022081609032947100_ref020","first-page":"103","article-title":"Particle swarm optimization for parallel machine scheduling problem with machine eligibility constraints","volume":"19","year":"2010","journal-title":"Chinese Journal of Electronics"},{"issue":"4","key":"key2022081609032947100_ref021","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s11721-016-0128-z","article-title":"Inertia weight control strategies for particle swarm optimization","volume":"10","year":"2016","journal-title":"Swarm Intelligence"},{"issue":"3","key":"key2022081609032947100_ref022","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1108\/IMDS-02-2018-0063","article-title":"Developing intuitionistic fuzzy seasonality regression with particle swarm optimization for air pollution forecasting","volume":"119","year":"2019","journal-title":"Industrial Management and Data Systems"},{"volume-title":"Factory Physics","year":"2008","key":"key2022081609032947100_ref023"},{"key":"key2022081609032947100_ref024","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.asoc.2015.01.028","article-title":"Decision support for unrelated parallel machine scheduling with discrete controllable processing times","volume":"30","year":"2015","journal-title":"Applied Soft Computing"},{"first-page":"65","article-title":"A particle swarm optimization algorithm for minimizing total weighted tardiness of unrelated parallel batch processing machines with unequal ready times","year":"2018","key":"key2022081609032947100_ref025"},{"key":"key2022081609032947100_ref026","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.cie.2017.09.037","article-title":"Scheduling non-identical parallel batch processing machines to minimize total weighted tardiness using particle swarm optimization","volume":"113","year":"2017","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"key2022081609032947100_ref027","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","article-title":"Single machine scheduling subject to deadlines and resource dependent processing times","volume":"94","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"key2022081609032947100_ref028","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.cie.2008.05.007","article-title":"A discrete particle swarm optimization algorithm for scheduling parallel machines","volume":"56","year":"2009","journal-title":"Computers and Industrial Engineering"},{"key":"key2022081609032947100_ref029","doi-asserted-by":"crossref","unstructured":"Katoh, N. and Ibaraki, T. (1998), \u201cResource allocation problems\u201d, in Handbook of Combinatorial Optimization, Springer, pp.\u00a0905-1006.","DOI":"10.1007\/978-1-4613-0303-9_14"},{"issue":"3","key":"key2022081609032947100_ref030","first-page":"223","article-title":"Unrelated parallel machine scheduling with setup times using simulated annealing","volume":"18","year":"2002","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"key2022081609032947100_ref031","doi-asserted-by":"crossref","unstructured":"Lalwani, S., Sharma, H., Verma, A. and Deep, K. (2019), \u201cMinimization of makespan for parallel machines using pso to enhance caching of MSA-based multi-query processes\u201d, in Soft Computing for Problem Solving, Springer, pp.\u00a0193-205.","DOI":"10.1007\/978-981-13-1595-4_15"},{"key":"key2022081609032947100_ref032","article-title":"Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines","volume":"125","year":"2020","journal-title":"Computers and Operations Research"},{"issue":"1","key":"key2022081609032947100_ref033","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ijpe.2013.01.025","article-title":"Minimizing total tardiness for the order scheduling problem","volume":"144","year":"2013","journal-title":"International Journal of Production Economics"},{"issue":"8","key":"key2022081609032947100_ref034","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1080\/10170669.2012.737374","article-title":"Parallel machines scheduling with deterioration effects and resource allocations","volume":"29","year":"2012","journal-title":"Journal of the Chinese Institute of Industrial Engineers"},{"issue":"5","key":"key2022081609032947100_ref035","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","article-title":"Order scheduling in an environment with dedicated resources in parallel","volume":"8","year":"2005","journal-title":"Journal of Scheduling"},{"key":"key2022081609032947100_ref036","doi-asserted-by":"crossref","unstructured":"Leung, J.Y.T., Li, H. and Pinedo, M. (2005b), \u201cOrder scheduling models: an overview\u201d, in Multidisciplinary Scheduling: Theory and Applications, Springer, pp.\u00a037-53.","DOI":"10.1007\/0-387-27744-7_3"},{"issue":"8","key":"key2022081609032947100_ref037","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/j.dam.2006.09.012","article-title":"Scheduling orders for multiple product types to minimize total weighted completion time","volume":"155","year":"2007","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"key2022081609032947100_ref038","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1108\/IMDS-04-2017-0145","article-title":"A novel method to solve sustainable economic power loading dispatch problem","volume":"118","year":"2018","journal-title":"Industrial Management and Data Systems"},{"issue":"8","key":"key2022081609032947100_ref040","doi-asserted-by":"crossref","first-page":"1726","DOI":"10.1080\/01605682.2020.1718010","article-title":"Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time","volume":"72","year":"2021","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"key2022081609032947100_ref039","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1108\/IMDS-07-2018-0314","article-title":"A green vehicle routing model based on modified particle swarm optimization for cold chain logistics","volume":"119","year":"2019","journal-title":"Industrial Management and Data Systems"},{"key":"key2022081609032947100_ref041","first-page":"1","article-title":"Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates","volume":"2013","year":"2013","journal-title":"Mathematical Problems in Engineering"},{"issue":"4","key":"key2022081609032947100_ref042","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1057\/jors.2015.82","article-title":"Multi-objective parallel machine scheduling problems by considering controllable processing times","volume":"67","year":"2016","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"key2022081609032947100_ref043","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10601-011-9115-6","article-title":"Optimal methods for resource allocation and scheduling: a cross-disciplinary survey","volume":"17","year":"2012","journal-title":"Constraints"},{"issue":"4","key":"key2022081609032947100_ref044","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1080\/21681015.2016.1139005","article-title":"Unrelated parallel-machine scheduling with controllable processing times and eligibility constraints to minimize the makespan","volume":"33","year":"2016","journal-title":"Journal of Industrial and Production Engineering"},{"issue":"3","key":"key2022081609032947100_ref045","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1080\/09537280110065517","article-title":"A hybrid genetic algorithm for the batch sequencing problem on identical parallel machines","volume":"13","year":"2002","journal-title":"Production Planning and Control"},{"issue":"2","key":"key2022081609032947100_ref046","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","article-title":"Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing","volume":"87","year":"2004","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"key2022081609032947100_ref047","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0954-1810(99)00021-7","article-title":"A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines","volume":"13","year":"1999","journal-title":"Artificial Intelligence in Engineering"},{"key":"key2022081609032947100_ref048","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.asoc.2015.12.035","article-title":"A robust hybrid approach based on particle swarm optimization and genetic algorithm to minimize the total machine load on unrelated parallel machines","volume":"41","year":"2016","journal-title":"Applied Soft Computing"},{"issue":"2","key":"key2022081609032947100_ref049","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10898-004-5703-y","article-title":"Minimizing completion time variance with compressible processing times","volume":"31","year":"2005","journal-title":"Journal of Global Optimization"},{"issue":"5","key":"key2022081609032947100_ref050","first-page":"723","article-title":"A hybrid particle swarm optimization for parallel machine total tardiness scheduling","volume":"49","year":"2010","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"key2022081609032947100_ref051","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.cie.2015.10.019","article-title":"A l\u00e9vy flight embedded particle swarm optimization for multi-objective parallel-machine scheduling with learning and adapting considerations","volume":"91","year":"2016","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"key2022081609032947100_ref052","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2006.12.006","article-title":"A survey on the continuous nonlinear resource allocation problem","volume":"185","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"key2022081609032947100_ref053","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1108\/IMDS-01-2020-0049","article-title":"Managers\u2019 risk perception of supply chain uncertainties","volume":"120","year":"2020","journal-title":"Industrial Management and Data Systems"},{"issue":"1","key":"key2022081609032947100_ref054","article-title":"Integrating scheduling with optimal sublot for parallel machine with job splitting and dependent setup times","volume":"137","year":"2019","journal-title":"Computers and Industrial Engineering"},{"issue":"13","key":"key2022081609032947100_ref055","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","article-title":"A survey of scheduling with controllable processing times","volume":"155","year":"2007","journal-title":"Discrete Applied Mathematics"},{"first-page":"1945","article-title":"Empirical study of particle swarm optimization","year":"1999","key":"key2022081609032947100_ref056"},{"issue":"1-3","key":"key2022081609032947100_ref057","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","article-title":"An approximation algorithm for the generalized assignment problem","volume":"62","year":"1993","journal-title":"Mathematical Programming"},{"volume-title":"Simultaneous Perturbation Stochastic Approximation","year":"2005","key":"key2022081609032947100_ref058"},{"issue":"5","key":"key2022081609032947100_ref059","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1080\/00207721.2011.649366","article-title":"Scheduling on parallel machines to minimise maximum lateness for the customer order problem","volume":"44","year":"2013","journal-title":"International Journal of Systems Science"},{"issue":"2","key":"key2022081609032947100_ref060","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1108\/IMDS-08-2020-0491","article-title":"Optimal pricing and ordering policies with different patience levels of consumers","volume":"121","year":"2021","journal-title":"Industrial Management and Data Systems"},{"issue":"12","key":"key2022081609032947100_ref061","doi-asserted-by":"crossref","first-page":"4750","DOI":"10.1016\/j.asoc.2013.07.029","article-title":"A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem","volume":"13","year":"2013","journal-title":"Applied Soft Computing"},{"issue":"2","key":"key2022081609032947100_ref062","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1287\/opre.42.2.234","article-title":"Scheduling multiple variable-speed machines","volume":"42","year":"1994","journal-title":"Operations Research"},{"volume-title":"Simulated Annealing: Theory and Applications","year":"1987","key":"key2022081609032947100_ref063"},{"issue":"1","key":"key2022081609032947100_ref064","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","year":"1992","journal-title":"Operations Research"},{"first-page":"3808","article-title":"Stochastic optimization with inequality constraints using simultaneous perturbations and penalty functions","year":"2003","key":"key2022081609032947100_ref065"},{"key":"key2022081609032947100_ref066","first-page":"268","article-title":"The statistical analysis of simulation results","volume-title":"The Computer Performance Modeling Handbook","year":"1983"},{"issue":"2","key":"key2022081609032947100_ref067","first-page":"65","article-title":"A genetic algorithm tutorial","volume":"4","year":"1994","journal-title":"Statistics and Computing"},{"key":"key2022081609032947100_ref068","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jmsy.2020.12.013","article-title":"A robust customer order scheduling problem along with scenario-dependent component processing times and due dates","volume":"58","year":"2021","journal-title":"Journal of Manufacturing Systems"},{"issue":"1","key":"key2022081609032947100_ref069","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TASE.2013.2291899","article-title":"Customer order scheduling on unrelated parallel machines to minimize total completion time","volume":"12","year":"2015","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"first-page":"2317","article-title":"Stochastic customer order scheduling using simulation-based genetic algorithm","year":"2015","key":"key2022081609032947100_ref070"},{"key":"key2022081609032947100_ref071","first-page":"1","article-title":"Stochastic customer order scheduling to minimize long-run expected order cycle time","year":"2016","journal-title":"Annals of Operations Research"},{"issue":"4","key":"key2022081609032947100_ref072","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1080\/00207543.2013.841330","article-title":"Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions","volume":"52","year":"2014","journal-title":"International Journal of Production Research"},{"issue":"4","key":"key2022081609032947100_ref073","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1109\/TASE.2018.2796090","article-title":"Minimizing expected cycle time of stochastic customer orders through bounded multi-fidelity simulations","volume":"15","year":"2018","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"7","key":"key2022081609032947100_ref074","doi-asserted-by":"crossref","first-page":"2684","DOI":"10.1080\/00207543.2017.1381348","article-title":"Stochastic customer order scheduling with setup times to minimize expected cycle time","volume":"56","year":"2018","journal-title":"International Journal of Production Research"},{"key":"key2022081609032947100_ref075","article-title":"Stochastic customer order scheduling on heterogeneous parallel machines with resource allocation consideration","volume":"160","year":"2021","journal-title":"Computers and Industrial Engineering"}],"container-title":["Industrial Management &amp; Data Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-02-2022-0105\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-02-2022-0105\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:51:22Z","timestamp":1753393882000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/imds\/article\/122\/8\/1882-1908\/176768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":75,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2022,7,19]]},"published-print":{"date-parts":[[2022,8,16]]}},"alternative-id":["10.1108\/IMDS-02-2022-0105"],"URL":"https:\/\/doi.org\/10.1108\/imds-02-2022-0105","relation":{},"ISSN":["0263-5577"],"issn-type":[{"type":"print","value":"0263-5577"}],"subject":[],"published":{"date-parts":[[2022,7,19]]}}}