Pub Date : 2023-11-11DOI: 10.1007/s10696-023-09518-6
Martina Doneda, Semih Yalçındağ, Ettore Lanzarone
Abstract In Western countries, the so-called Blood Donation Supply Chain (BDSC) provides blood units to several health services. Its first echelon is the collection of unit from donors, which requires a careful management because an unbalanced supply of units to the rest of the chain could trigger alternating periods of blood shortage and wastage. However, the management of blood collection is only marginally studied in the literature, in comparison to other BDSC echelons. In this work, we propose a new organizational model for blood collection, in which blood is collected at donor’s homes, and provide a decision support tool for its management. This new model provides a novel contribution to the understudied blood collection echelon and, at the same time, it responds to the emerging need of delocalization of health services. The proposed decision support tool consists of an interconnected matheuristic framework with three decision stages: (i) a planning model to create the donation slots that will be assigned to donors, (ii) an online allocation of these slots using a flexible set of criteria, and (iii) a Multi-Trip Vehicle Routing Problem with Time Windows (MTVRP-TW) to route the bloodmobiles that collect blood at donors’ homes. The main goals are to balance the production of blood units between days and to minimize the distance travelled by the bloodmobile fleet, while respecting time windows negotiated with donors. This framework also has the feature of immediately providing a list of slots to choose from when a donor makes a booking request. The decision support tool has been tested on data from a real Italian provider. Results confirm its effectiveness, and the capability of providing good quality and economically sustainable solutions in reasonable timeframes.
{"title":"A three-stage matheuristic for home blood donation appointment reservation and collection routing","authors":"Martina Doneda, Semih Yalçındağ, Ettore Lanzarone","doi":"10.1007/s10696-023-09518-6","DOIUrl":"https://doi.org/10.1007/s10696-023-09518-6","url":null,"abstract":"Abstract In Western countries, the so-called Blood Donation Supply Chain (BDSC) provides blood units to several health services. Its first echelon is the collection of unit from donors, which requires a careful management because an unbalanced supply of units to the rest of the chain could trigger alternating periods of blood shortage and wastage. However, the management of blood collection is only marginally studied in the literature, in comparison to other BDSC echelons. In this work, we propose a new organizational model for blood collection, in which blood is collected at donor’s homes, and provide a decision support tool for its management. This new model provides a novel contribution to the understudied blood collection echelon and, at the same time, it responds to the emerging need of delocalization of health services. The proposed decision support tool consists of an interconnected matheuristic framework with three decision stages: (i) a planning model to create the donation slots that will be assigned to donors, (ii) an online allocation of these slots using a flexible set of criteria, and (iii) a Multi-Trip Vehicle Routing Problem with Time Windows (MTVRP-TW) to route the bloodmobiles that collect blood at donors’ homes. The main goals are to balance the production of blood units between days and to minimize the distance travelled by the bloodmobile fleet, while respecting time windows negotiated with donors. This framework also has the feature of immediately providing a list of slots to choose from when a donor makes a booking request. The decision support tool has been tested on data from a real Italian provider. Results confirm its effectiveness, and the capability of providing good quality and economically sustainable solutions in reasonable timeframes.","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"16 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135042899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-10DOI: 10.1007/s10696-023-09514-w
James C. Chen, Tzu-Li Chen, Yin-Yann Chen, Min-Yu Chung
{"title":"Multi-resource constrained scheduling considering process plan flexibility and lot streaming for the CNC machining industry","authors":"James C. Chen, Tzu-Li Chen, Yin-Yann Chen, Min-Yu Chung","doi":"10.1007/s10696-023-09514-w","DOIUrl":"https://doi.org/10.1007/s10696-023-09514-w","url":null,"abstract":"","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"104 32","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135137136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Donor profiling and donation prediction are two key tasks that any blood collection center must face. Profiling is important to target promotion campaigns, recruiting donors who will guarantee a high production of blood units over time. Predicting the future arrivals of donors allows to size the collection center properly and to provide reliable information on the future production of blood units. Both tasks can be addressed through a statistical prediction model for the intensity function of the donation event. We propose a Bayesian model, which describes this intensity as a function of individual donor’s random frailties and their fixed-time and time-dependent covariates. Our model explains donors’ behaviors from their first donation based on their individual characteristics. We apply it to data of recurrent donors provided by the Milan department of the Associazione Volontari Italiani del Sangue in Italy. Our method proved to fit those data, but it can also be easily applied to other blood collection centers. The method also allows general indications to be drawn, supported by quantitative analyses, to be provided to staff.
{"title":"Predicting donations and profiling donors in a blood collection center: a Bayesian approach","authors":"Ilenia Epifani, Ettore Lanzarone, Alessandra Guglielmi","doi":"10.1007/s10696-023-09516-8","DOIUrl":"https://doi.org/10.1007/s10696-023-09516-8","url":null,"abstract":"Abstract Donor profiling and donation prediction are two key tasks that any blood collection center must face. Profiling is important to target promotion campaigns, recruiting donors who will guarantee a high production of blood units over time. Predicting the future arrivals of donors allows to size the collection center properly and to provide reliable information on the future production of blood units. Both tasks can be addressed through a statistical prediction model for the intensity function of the donation event. We propose a Bayesian model, which describes this intensity as a function of individual donor’s random frailties and their fixed-time and time-dependent covariates. Our model explains donors’ behaviors from their first donation based on their individual characteristics. We apply it to data of recurrent donors provided by the Milan department of the Associazione Volontari Italiani del Sangue in Italy. Our method proved to fit those data, but it can also be easily applied to other blood collection centers. The method also allows general indications to be drawn, supported by quantitative analyses, to be provided to staff.","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"53 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135092743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-10DOI: 10.1007/s10696-023-09521-x
Thimo Bergenhenegouwen, T. A. Arno Kasper, Jos A. C. Bokhorst, Martin J. Land
Abstract This paper shows the effectiveness of labour transfers in addressing premature idleness caused by controlled order release. Controlled order release restricts order entry to the shop floor and is commonly employed in high-variety manufacturing where it results in benefits such as stable work-in-progress. However, it can increase waiting times when orders are blocked from release, while capacities are idling. This issue, known as premature idleness, negatively impacts delivery performance. Previous studies have primarily focused on addressing premature idleness through input control by releasing new orders to idling workstations. This approach overlooks the potential of output control during premature idleness, transferring labour to assist at other workstations in a dual resource constrained setting. Using simulation, this study demonstrates that output control significantly improves delivery performance—in terms of mean tardiness and percentage tardy—and reduces total and shop floor throughput times. Importantly, this result proves robust, even when the efficiency of the assisting worker is severely limited. Shop-level performance improves despite the efficiency loss of the worker. The impact of the where-rule is minimal, while the efficacy of the priority dispatching rule depends on the joint efficiency of collaborating workers. Finally, we show that combining input control and output control enhances performance, providing opportunities for further research on the role of both control approaches in high-variety manufacturing.
{"title":"Managing premature idleness in high-variety manufacturing","authors":"Thimo Bergenhenegouwen, T. A. Arno Kasper, Jos A. C. Bokhorst, Martin J. Land","doi":"10.1007/s10696-023-09521-x","DOIUrl":"https://doi.org/10.1007/s10696-023-09521-x","url":null,"abstract":"Abstract This paper shows the effectiveness of labour transfers in addressing premature idleness caused by controlled order release. Controlled order release restricts order entry to the shop floor and is commonly employed in high-variety manufacturing where it results in benefits such as stable work-in-progress. However, it can increase waiting times when orders are blocked from release, while capacities are idling. This issue, known as premature idleness, negatively impacts delivery performance. Previous studies have primarily focused on addressing premature idleness through input control by releasing new orders to idling workstations. This approach overlooks the potential of output control during premature idleness, transferring labour to assist at other workstations in a dual resource constrained setting. Using simulation, this study demonstrates that output control significantly improves delivery performance—in terms of mean tardiness and percentage tardy—and reduces total and shop floor throughput times. Importantly, this result proves robust, even when the efficiency of the assisting worker is severely limited. Shop-level performance improves despite the efficiency loss of the worker. The impact of the where-rule is minimal, while the efficacy of the priority dispatching rule depends on the joint efficiency of collaborating workers. Finally, we show that combining input control and output control enhances performance, providing opportunities for further research on the role of both control approaches in high-variety manufacturing.","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"120 32","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135137325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-31DOI: 10.1007/s10696-023-09522-w
Alessandro Agnetis
{"title":"Obituary for Professor Carlo Meloni (1970–2023)","authors":"Alessandro Agnetis","doi":"10.1007/s10696-023-09522-w","DOIUrl":"https://doi.org/10.1007/s10696-023-09522-w","url":null,"abstract":"","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"2010 28","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135813196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-25DOI: 10.1007/s10696-023-09513-x
James C. Chen, Tzu-Li Chen, Ping-Hsuan Wu
{"title":"Truck scheduling with fixed outbound departures in a closed-loop conveyor system with shortcuts","authors":"James C. Chen, Tzu-Li Chen, Ping-Hsuan Wu","doi":"10.1007/s10696-023-09513-x","DOIUrl":"https://doi.org/10.1007/s10696-023-09513-x","url":null,"abstract":"","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"15 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135113228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-18DOI: 10.1007/s10696-023-09511-z
Michael Geurtsen, Jelle Adan, Alp Akçay
Abstract This paper considers jointly scheduling the production and resource-constrained maintenance activities in a manufacturing setting with unrelated parallel machines. In particular, a single maintenance activity needs to be scheduled on each machine in one of its available time windows, and the maintenance activities require a scarce resource, thereby limiting the number of maintenance activities that can be scheduled simultaneously on different machines. In addition, machine- and sequence-dependent setup times, machine eligibility constraints and job-specific release and due dates are considered. A mixed-integer linear program is formulated with objectives including the makespan and, motivated from practice, a weighted sum of total production completion times at machines and total job tardiness. Additionally, a hybrid genetic algorithm with a novel solution representation is proposed for solving industry-scale large instances. A case study is performed with real-world data from a semiconductor manufacturer, where production and maintenance are scheduled separately. The benefit of simultaneously scheduling production and maintenance is investigated. Tests with real-world data show that the proposed model results in schedules that substantially improve the current factory practice.
{"title":"Integrated maintenance and production scheduling for unrelated parallel machines with setup times","authors":"Michael Geurtsen, Jelle Adan, Alp Akçay","doi":"10.1007/s10696-023-09511-z","DOIUrl":"https://doi.org/10.1007/s10696-023-09511-z","url":null,"abstract":"Abstract This paper considers jointly scheduling the production and resource-constrained maintenance activities in a manufacturing setting with unrelated parallel machines. In particular, a single maintenance activity needs to be scheduled on each machine in one of its available time windows, and the maintenance activities require a scarce resource, thereby limiting the number of maintenance activities that can be scheduled simultaneously on different machines. In addition, machine- and sequence-dependent setup times, machine eligibility constraints and job-specific release and due dates are considered. A mixed-integer linear program is formulated with objectives including the makespan and, motivated from practice, a weighted sum of total production completion times at machines and total job tardiness. Additionally, a hybrid genetic algorithm with a novel solution representation is proposed for solving industry-scale large instances. A case study is performed with real-world data from a semiconductor manufacturer, where production and maintenance are scheduled separately. The benefit of simultaneously scheduling production and maintenance is investigated. Tests with real-world data show that the proposed model results in schedules that substantially improve the current factory practice.","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"77 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135883939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-17DOI: 10.1007/s10696-023-09512-y
Tongxin Liu, Jun Li, Xihui Wang
{"title":"Enhancing the cost performance in regular humanitarian logistics: location-routing and delivery frequency optimization","authors":"Tongxin Liu, Jun Li, Xihui Wang","doi":"10.1007/s10696-023-09512-y","DOIUrl":"https://doi.org/10.1007/s10696-023-09512-y","url":null,"abstract":"","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135995579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Correction to: Anticipating technical car sequencing rules in the master production scheduling of mixed-model assembly lines","authors":"Thorben Krueger, Achim Koberstein, Norbert Bittner","doi":"10.1007/s10696-023-09510-0","DOIUrl":"https://doi.org/10.1007/s10696-023-09510-0","url":null,"abstract":"","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135044677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-27DOI: 10.1007/s10696-023-09509-7
Giacomo Lanza, Mauro Passacantando, Maria Grazia Scutellà
Abstract The paper addresses the green sequencing and routing problem, which consists in determining the best sequence of locations to visit within a warehouse for storing and/or retrieval operations, using a fleet composed of both electric vehicles, e.g., equipped with a lithium-ion battery, and conventional vehicles, i.e., with an internal combustion engine. We present a Mixed-Integer Linear Programming formulation to the problem and propose two matheuristics based on suitable decompositions of the mathematical formulation. The two matheuristics have been tested on a pool of small-medium size instances and their performance has been compared to the one of a third matheuristic, previously proposed for the case of conventional vehicles only and here suitable extended to deal with the green aspects of the problem. The performed analysis allowed one to identify the most promising matheuristic in terms of some standard computational indicators, i.e., computing time and percentage optimality gap, as well as in terms of some qualitative aspects of the solutions agreed with a reference company. Such a most promising algorithm has then been further tested to gather some technical insights on what makes the problem hard to solve, as well as to outline some managerial insights. Moreover, its performance has been tested on a pool of real instances comprising ordinary days (with a usual amount of operations to perform) and extremely busy days, showing its efficacy and efficiency also in the considered real application context.
{"title":"Matheuristic approaches to the green sequencing and routing problem","authors":"Giacomo Lanza, Mauro Passacantando, Maria Grazia Scutellà","doi":"10.1007/s10696-023-09509-7","DOIUrl":"https://doi.org/10.1007/s10696-023-09509-7","url":null,"abstract":"Abstract The paper addresses the green sequencing and routing problem, which consists in determining the best sequence of locations to visit within a warehouse for storing and/or retrieval operations, using a fleet composed of both electric vehicles, e.g., equipped with a lithium-ion battery, and conventional vehicles, i.e., with an internal combustion engine. We present a Mixed-Integer Linear Programming formulation to the problem and propose two matheuristics based on suitable decompositions of the mathematical formulation. The two matheuristics have been tested on a pool of small-medium size instances and their performance has been compared to the one of a third matheuristic, previously proposed for the case of conventional vehicles only and here suitable extended to deal with the green aspects of the problem. The performed analysis allowed one to identify the most promising matheuristic in terms of some standard computational indicators, i.e., computing time and percentage optimality gap, as well as in terms of some qualitative aspects of the solutions agreed with a reference company. Such a most promising algorithm has then been further tested to gather some technical insights on what makes the problem hard to solve, as well as to outline some managerial insights. Moreover, its performance has been tested on a pool of real instances comprising ordinary days (with a usual amount of operations to perform) and extremely busy days, showing its efficacy and efficiency also in the considered real application context.","PeriodicalId":50441,"journal":{"name":"Flexible Services and Manufacturing Journal","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135536714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：