International Journal of Production Research最新文献

{"title":"Two-stage electricity production scheduling with energy storage and dynamic emission modelling","authors":"Bi Fan, Fengjie Liao, Chao Yang, Quande Qin","doi":"10.1080/00207543.2023.2280186","DOIUrl":"https://doi.org/10.1080/00207543.2023.2280186","url":null,"abstract":"AbstractWith increasing environmental concerns and energy crisis, a variety of renewable energy sources (RES) are being increasingly utilised worldwide. However, the integration of RES such as wind power and photovoltaics in large-scale can lead to increased load fluctuations, which can undermine the overall environmental benefits and pose risks to the secure and stable operation of the power system. To mitigate this challenge, a two-stage electricity production scheduling is developed incorporating energy storage system (ESS) and dynamic emission modelling (DEM). In the first stage, a multi-objective mixed integer programming model schedules the production of RES, increasing penetration rate and system stability. In the second stage, a data-driven dynamic emission model is developed to optimise the load allocation of thermal power unit to reduce the carbon emissions. Furthermore, a flexible operating reserve strategy is proposed to handle the uncertainty resulting from the intermittent character of RES. Experimental results demonstrate that the proposed method effectively schedules the production of RES thereby alleviating the contradiction between high RES utilisation and stable system operation. Compared to the benchmark model, the proposed method can reduce the carbon emissions and total cost of the system by 20.34% and 10.65%, respectively.KEYWORDS: Renewable integrationenergy storage systemdynamic emissiongeneration scheduleoperational flexibility Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementThe data presented in this study are available as request.Additional informationFundingThis research was supported by the National Natural Science Foundation of China [grant numbers 72174124, 71871146, 71701136], the Natural Science Foundation of Guangdong Province [grant numbers 2022A1515011009, 2021A1515010987], Shenzhen Science and Technology Program [grant number JCYJ20210324093414039], and by NTUT-SZU Joint Research Program [grant number 2023005].Notes on contributorsBi FanBi Fan, is an Associate Professor in the College of Management, Shenzhen University, Shenzhen, China. He received his Ph.D. degree in System Engineering and Engineering Management from City University of Hong Kong, in 2014. His research interests include the optimisation problems related to energy system management, intelligent manufacturing, and data-driven decisions.Fengjie LiaoFengjie Liao, is currently a postgraduate at College of Management, Shenzhen University, Shenzhen, China. He received the B.S degree from Shanghai Maritime University, Shanghai, China. His main research interests include power system dispatch and renewable energy planning.Chao YangChao Yang, is currently an Assistant Professor in Shenzhen University. He received the Ph.D. degree from Shenzhen University, Shenzhen, China, in 2020. His research interests include urbanisation, sustainable development, and the social-ecological effects of huma","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":" 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135241063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Scheduling on identical machines with preemption and setup times","authors":"Amina Haned, Abida Kerdali, Mourad Boudhar","doi":"10.1080/00207543.2023.2276825","DOIUrl":"https://doi.org/10.1080/00207543.2023.2276825","url":null,"abstract":"AbstractIn this paper, we address the problem of scheduling jobs on identical machines for minimising the maximum completion time (makespan). Each job requires a sequence-independent setup time, which represents the time needed to prepare the machines for job execution. Then, we introduce a dynamic programme to solve the case with two machines, and show that this problem admits a fully polynomial time approximation scheme. For the case of m machines, we propose heuristics and an adapted genetic algorithm. Some numerical experiments are done to evaluate the proposed algorithms.Keywords: Schedulingpreemptionsetup timesmakespandynamic programmingFPTAS Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementThe authors confirm that the data supporting the findings of this study are available within the article.Notes1 mod(n,m) is the remainder of the Euclidean division of n by m.Additional informationNotes on contributorsAmina HanedAmina Haned received her PhD in mathematics at the University USTHB of Algiers. She is a lecturer at the Faculty of Economic Sciences, Commercial Sciences and Management Sciences, University Algiers 3. Amina is deeply interested in the fields of optimisation, operational research, and data science, with a particular focus on scheduling and operations optimisation.Abida KerdaliAbida Kerdali received her PhD in National Higher School of Statistics and Applied Economics. She is a Lecturer at the same School in University center of Kola, Algeria. Her research area is operational research, with a focus on economic problems.Mourad BoudharMourad Boudhar received his PhD in mathematics at the University USTHB of Algiers. He is a professor at the Department of Operational Research, University USTHB. His research interests include issues related to operational research and optimisation, with a particular focus on scheduling problems with new constraints as transportation, conflict, recirculation, multi-agents, etc. He has published several research papers in national and international journals and conference proceedings.","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":"131 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135342198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A policy-based Monte Carlo tree search method for container pre-marshalling","authors":"Ziliang Wang, Chenhao Zhou, Ada Che, Jingkun Gao","doi":"10.1080/00207543.2023.2279130","DOIUrl":"https://doi.org/10.1080/00207543.2023.2279130","url":null,"abstract":"AbstractThe container pre-marshalling problem (CPMP) aims to minimise the number of reshuffling moves, ultimately achieving an optimised stacking arrangement in each bay based on the priority of containers during the non-loading phase. Given the sequential decision nature, we formulated the CPMP as a Markov decision process (MDP) model to account for the specific state and action of the reshuffling process. To address the challenge that the relocated container may trigger a chain effect on the subsequent reshuffling moves, this paper develops an improved policy-based Monte Carlo tree search (P-MCTS) to solve the CPMP, where eight composite reshuffling rules and modified upper confidence bounds are employed in the selection phases, and a well-designed heuristic algorithm is utilised in the simulation phases. Meanwhile, considering the effectiveness of reinforcement learning methods for solving the MDP model, an improved Q-learning is proposed as the compared method. Numerical results show that the P-MCTS outperforms all compared methods in scenarios where all containers have different priorities and scenarios where containers can share the same priority.KEYWORDS: Container pre-marshalling problemMonte Carlo tree searchMarkov decision processQ-learning algorithmAutomated container terminal AcknowledgementThis research was made possible with funding support from National Natural Science Foundation of China [72101203, 71871183], Shaanxi Provincial Key R&D Program, China [2022KW-02], and China Scholarship Council [grant number 202206290124].Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementData sharing not applicable – no new data generated.Additional informationFundingThis work was supported by National Natural Science Foundation of China: [Grant Number 72101203, 71871183]; China Scholarship Council: [Grant Number 202206290124]; Shaanxi Provincial Key R&D Program, China: [Grant Number 2022KW-02].Notes on contributorsZiliang WangMr. Ziliang Wang, is a Doctoral student from School of Management in Northwestern Polytechnical University.Chenhao ZhouDr. Chenhao Zhou, is a Professor from School of Management in Northwestern Polytechnical University. Prior to this, he was a Research Assistant Professor in the Department of Industrial Systems Engineering and Management, National University of Singapore. His research interests are transportation systems and maritime logistics using simulation and optimization methods.Ada CheDr. Ada Che, is a Professor from School of Management in Northwestern Polytechnical University. He received the B.S. and Ph.D. degrees in Mechanical Engineering from Xi’an Jiaotong University in 1994 and 1999, respectively. Since 2005, he has been a Professor in School of Management in Northwestern Polytechnical University. His current research interests include transportation planning and optimisation, production scheduling, and operations research.Jingkun GaoMr. Jingkun Gao, is","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":"273 9‐13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135474816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs","authors":"Manolis N. Kritikos, George Ioannou","doi":"10.1080/00207543.2023.2276818","DOIUrl":"https://doi.org/10.1080/00207543.2023.2276818","url":null,"abstract":"AbstractIn this paper, we introduce the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs. The problem is a variant of the capacitated minimum spanning tree problem with arc time windows (CMSTP_ATW). We devise a mixed integer programming (MIP) formulation to model the problem and solve it using CPLEX. Furthermore, we propose three sets of inequalities, and we prove that they are valid. These valid inequalities tighten the model and lead to better lower bounds. To examine the quality of the solutions obtained, we convert the original data sets of Solomon (Citation1987, “Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints.” Operations Research 35 (2): 254–265. https://doi.org/10.1287/opre.35.2.254) to approximate the non-unit demand CMSTP_ATW instances and provide results for the problems with 100 nodes. We execute extensive computational experiments, and the results show the positive effect of the inclusion of valid inequalities in the MIP.KEYWORDS: Capacitated minimum spanning treearc time windowsmixed integer programming formulationvalid inequalitiesflow costs AcknowledgementsThe authors would like to thank the anonymous reviewers, the Associate Editor and the Special Issue Editor for their acute comments and constructive suggestions that helped improve the content and the presentation of the manuscript.Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementThe data that support the findings of this study are available from the corresponding author, [M.N.K.], upon request.Additional informationNotes on contributorsManolis N. KritikosManolis Kritikos is Professor of Operations Research and Information Systems at the Department of Management Science and Technology, Athens University of Economics and Business (AUEB). He obtained his Ph.D. in Management Science from AUEB and his MSc in Operations Research and Information Systems and BSc in Mathematics, both from the University of Athens. His doctoral research has been funded by the EDAMBA (European Doctoral Programme Association in Management and Business Administration) programme, with host institute the Rotterdam Business School. He is serving as Director of the Management Science Laboratory (MSL) of AUEB. His research interests include combinatorial optimisation, mathematical programming models, design and analysis of algorithms for operational research problems and performance measurement. In recent years, he published papers on top-ranked journal including OMEGA, Expert Systems with Applications, the International Journal of Production Economics, Journal of the Operational Research Society, International Transactions in Operational Research, Socio-Economic Planning Sciences, Applied economics, and Operational Research. He is associate editor of the Journal of Statistics and Management Systems. He was awarded the Certificate of Outstanding Contribution in Review","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":"59 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135726126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Special issue on collaborative production and maintenance in the environment of big data and industry 4.0","authors":"Bin Liu, Kerem Akartunali, Stéphane Dauzère-pérès, Shaomin Wu","doi":"10.1080/00207543.2023.2244844","DOIUrl":"https://doi.org/10.1080/00207543.2023.2244844","url":null,"abstract":"","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":"37 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135868351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Closed-loop inventory routing problem for perishable food with returnable transport items selection","authors":"Yipei Zhang, Feng Chu, Ada Che, Yantong Li","doi":"10.1080/00207543.2023.2275639","DOIUrl":"https://doi.org/10.1080/00207543.2023.2275639","url":null,"abstract":"AbstractUrged by the necessity to establish sustainable supply chains (SCs), this study focuses on exploring the closed-loop inventory routing problem (CIRP) for perishable food packed by multi-type returnable transport items (RTIs). The selling revenue of perishable food is dependent on food's remaining shelf life and the specific type of RTIs used for packaging. RTI selection decisions need to be jointly considered in the CIRP to weigh the potential benefits against associated costs. For this problem, we first develop an integer linear programme (ILP) to maximise the total profit of the holistic SC. Subsequently, we design a tailored kernel search (KS) matheuristic as an efficient solution. A real CIRP with multi-type RTIs for fresh strawberries is used to demonstrate the practicality of the ILP. For this case study, we perform extensive sensitivity analysis of the relevant parameters, extracting valuable managerial insights. Finally, experiments are conducted on 170 randomly generated instances. Computational results show that the proposed KS manages to achieve competitive solutions for instances with up to 10 retailers much more efficiently than CLPEX. For instances with up to 40 retailers, the KS algorithm significantly outperforms CPLEX in terms of solution quality, improving the obtained profit by 80.03% on average under the same computational time.KEYWORDS: Closed-loop inventory routingperishable foodinteger linear programmemulti-type RTIskernel search matheuristic AcknowledgementsThis work was partially derived from the first author’s Doctoral dissertation ‘Zhang, Y. (2019). Optimisation of closed-loop food supply chain with returnable transport items (Doctoral dissertation, University of Paris-Saclay; Northwestern Polytechnical University, Xi'an (China))’.Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementThe data that support the findings of this study are available from the corresponding author Ada Che, Email: ache@nwpu.edu.cn, upon reasonable request.Additional informationFundingThis work was partially supported by the National Natural Science Foundation of China [grant numbers 72201040, 72310107003 and 72271201], the China Postdoctoral Science Foundation [grant number 2021M700527], the Youth Innovation Team of Shaanxi Universities [grant number 22JP003], and the Fundamental Research Funds for the Central Universities [grant number 300102232607]. The authors also wish to thank all anonymous reviewers whose constructive comments helped to improve this paper.Notes on contributorsYipei ZhangYipei Zhang received the M.S. degree in management science and engineering from Northwestern Polytechnical University, Xi’an, China, in 2015, and the Ph.D. degrees from the University of Paris Saclay, Paris, France, and Northwestern Polytechnical University, Xi’an, China, in 2019 and 2020.Dr. Zhang is currently a Lecturer with Chang’an University. She has authored or coauthored articles publ","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":"32 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135973273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A decomposition and coordination method for optimising ( <i>Q</i> , <b> <i>S</i> </b> ) policies in a two-echelon distribution system with joint replenishment","authors":"Lei Wang, Haoxun Chen","doi":"10.1080/00207543.2023.2276808","DOIUrl":"https://doi.org/10.1080/00207543.2023.2276808","url":null,"abstract":"AbstractA continuous-review, two-echelon distribution system with one central distribution centre (CDC) and multiple regional distribution centres (RDCs) is studied. The CDC jointly replenishes its inventories of multiple items from an external supplier, while each RDC replenishes its inventories of the items from the CDC. Each RDC faces a Poisson demand for each item, and the inventories of each stock in the system are controlled by a (Q, S) policy. Under this policy, an order is placed by a stock whenever its aggregate demand since the last order reaches a given quantity, and the inventory position of each item is raised up to its order-up-to level after the order placement. The objective is to optimise these (Q, S) policies so that the expected total cost of this system is minimised. We propose a decomposition and coordination method for this optimisation after deriving analytically the cost function of the system. Our extensive numerical experiments demonstrate the effectiveness of the proposed method. Furthermore, a parameter sensitivity analysis is conducted to analyse the impacts of some key system parameters on the performance of the method, and managerial insights are provided for optimising distribution systems with joint replenishment and real applications of the method.KEYWORDS: Inventory managementjoint replenishmentdistribution systemdecomposition and coordinationoptimisation Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementThe authors confirm that the data supporting the findings of this study are available within the article and its supplementary materials.Additional informationFundingThis work was supported by China Scholarship Council with [grant number 201806950117].Notes on contributorsLei WangLei Wang received his B.Eng. and M.Sc. degrees in logistics engineering from Wuhan University of Technology, China, in 2017 and 2019, respectively. He received his Ph.D. degree in system security and optimisation from University of Technology of Troyes, France, in 2023. He has published an article in the Computers & Operations Research. His current research interests include inventory management, supply chain optimisation, and operations research.Haoxun ChenHaoxun Chen received his B. S. degree in applied mathematics from Fudan University, China, in 1984, his Master and Ph.D. degree in systems engineering in 1987 and 1990, respectively, from Xi’an Jiaotong University, China. He was with Xi’an Jiaotong University as a Lecturer from 1990 to 1992 and as an Associate Professor from 1993 to 1996. He visited INRIA-Lorraine, France, as a Visiting Professor, in 1994, University of Magdeburg, Germany, as a Research Fellow of Alexander von Humboldt Foundation, in 1997 and 1998, and University of Connecticut as an Assistant Professor in 1999 and 2000. He joined University of Technology of Troyes, France, in 2001 and has been a Full Professor since 2004. His research interests include sup","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":"34 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135973405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"From natural language to simulations: applying AI to automate simulation modelling of logistics systems","authors":"Ilya Jackson, Maria Jesus Saenz, Dmitry Ivanov","doi":"10.1080/00207543.2023.2276811","DOIUrl":"https://doi.org/10.1080/00207543.2023.2276811","url":null,"abstract":"Our research strives to examine how simulation models of logistics systems can be produced automatically from verbal descriptions in natural language and how human experts and artificial intelligence (AI)-based systems can collaborate in the domain of simulation modelling. We demonstrate that a framework constructed upon the refined GPT-3 Codex is capable of generating functionally valid simulations for queuing and inventory management systems when provided with a verbal explanation. As a result, the language model could produce simulation models for inventory and process control. These results, along with the rapid improvement of language models, enable a significant simplification of simulation model development. Our study offers guidelines and a design of a natural language processing-based framework on how to build simulation models of logistics systems automatically, given the verbal description. In generalised terms, our work offers a technological underpinning of human-AI collaboration for the development of simulation models.","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":"63 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135934995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel approach for predicting Lockout/Tagout safety procedures for smart maintenance strategies","authors":"Victor Delpla, Kevin Chapron, Jean-Pierre Kenné, Lucas A. Hof","doi":"10.1080/00207543.2023.2275635","DOIUrl":"https://doi.org/10.1080/00207543.2023.2275635","url":null,"abstract":"","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":"79 23-24","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135272887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Weighted tardiness minimisation for unrelated machines with sequence-dependent and resource-constrained setups","authors":"Ioannis Avgerinos, Ioannis Mourtos, Stavros Vatikiotis, Georgios Zois","doi":"10.1080/00207543.2023.2275634","DOIUrl":"https://doi.org/10.1080/00207543.2023.2275634","url":null,"abstract":"AbstractMotivated by the need of quick job (re-)scheduling, we examine an elaborate scheduling environment under the objective of total weighted tardiness minimisation. The examined problem variant moves well beyond existing literature, as it considers unrelated machines, sequence-dependent and machine-dependent setup times, and a renewable resource constraint on the number of simultaneous setups. For this variant, we provide a relaxed MILP to calculate lower bounds, thus estimating a worst-case optimality gap. As a fast exact approach appears not plausible for instances of practical importance, we extend known (meta-)heuristics to deal with the problem at hand, coupling them with a Constraint Programming (CP) component – vital to guarantee the non-violation of the problem's constraints – which optimally allocates resources with respect to tardiness minimisation. The validity and versatility of employing different (meta-)heuristics exploiting a relaxed MILP as a quality measure are revealed by our extensive experimental study, which shows that the methods deployed have complementary strengths depending on the instance parameters. Since the problem description has been obtained from a textile manufacturer where jobs of diverse size arrive continuously under tight due dates, we also discuss the practical impact of our approach in terms of both tardiness decrease and broader managerial insights.KEYWORDS: Parallel machine schedulingsequence-dependent setup timesweighted tardinessmetaheuristicstextile manufacturing Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementInstances, results and codes that support the findings of this work are available at https://github.com/svatikiot/Weighted_Tardiness_Experiments.Additional informationFundingThis research has been supported by the EU through the FACTLOG Horizon 2020 project, grant number 869951.Notes on contributorsIoannis AvgerinosIoannis Avgerinos is a Ph.D. candidate in combinatorial optimization at the Department of Management Science and Technology, Athens University of Economics and Business, Greece. He received the Bachelor's degree in geomatics engineering from National Technical University of Athens and the Master's degree in management science and technology from Athens University of Economics and Business. His research interests include combinatorial optimisation, decomposition methods and their implementation on transport and production scheduling problems.Ioannis MourtosIoannis Mourtos is a professor at the Department of Management Science and Technology, Athens University of Economics and Business. He studied computer engineering and informatics at University of Patras and operations research at London School of Economics and Political Science. His academic interests lie within combinatorial optimisation, polyhedral combinatorics and the integration of integer programming with constraint programming. His work has been applied to optim","PeriodicalId":14307,"journal":{"name":"International Journal of Production Research","volume":"75 11-12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135272623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}