Pub Date : 2023-11-27DOI: 10.1007/s10100-023-00888-8
Belma Turan, V. Hemmelmayr, Allan Larsen, Jakob Puchinger
{"title":"Transition towards sustainable mobility: the role of transport optimization","authors":"Belma Turan, V. Hemmelmayr, Allan Larsen, Jakob Puchinger","doi":"10.1007/s10100-023-00888-8","DOIUrl":"https://doi.org/10.1007/s10100-023-00888-8","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139231799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-15DOI: 10.1007/s10100-023-00892-y
Christina Hess, Alina G. Dragomir, K. Doerner, Daniele Vigo
{"title":"Waste collection routing: a survey on problems and methods","authors":"Christina Hess, Alina G. Dragomir, K. Doerner, Daniele Vigo","doi":"10.1007/s10100-023-00892-y","DOIUrl":"https://doi.org/10.1007/s10100-023-00892-y","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139273354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-28DOI: 10.1007/s10100-023-00891-z
Raphael Herding, Lars Mönch
Abstract Demand fulfillment and order management are important functions in semiconductor supply chains to interact with customers. In this paper, an iterative short-term demand supply matching (STDSM) algorithm based on mixed-integer linear programming (MILP) is proposed. This approach repromises orders taking into account the finite capacity of the shop floor. Decomposition is used to obtain computationally tractable subproblems. The STDSM approach is applied together with master planning and allocation planning in a rolling horizon setting. A simulation model of a simplified semiconductor supply chain is used for the rolling horizon experiments. The experiments demonstrate that the proposed STDSM scheme outperforms conventional business rule-based heuristics with respect to several delivery performance-related measures and with respect to stability.
{"title":"A rolling horizon planning approach for short-term demand supply matching","authors":"Raphael Herding, Lars Mönch","doi":"10.1007/s10100-023-00891-z","DOIUrl":"https://doi.org/10.1007/s10100-023-00891-z","url":null,"abstract":"Abstract Demand fulfillment and order management are important functions in semiconductor supply chains to interact with customers. In this paper, an iterative short-term demand supply matching (STDSM) algorithm based on mixed-integer linear programming (MILP) is proposed. This approach repromises orders taking into account the finite capacity of the shop floor. Decomposition is used to obtain computationally tractable subproblems. The STDSM approach is applied together with master planning and allocation planning in a rolling horizon setting. A simulation model of a simplified semiconductor supply chain is used for the rolling horizon experiments. The experiments demonstrate that the proposed STDSM scheme outperforms conventional business rule-based heuristics with respect to several delivery performance-related measures and with respect to stability.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136161064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-27DOI: 10.1007/s10100-023-00889-7
Gustav Feichtinger, Dieter Grass, Peter M. Kort, Andreas J. Novak, Andrea Seidl, Stefan Wrzaczek
{"title":"How Hartl exceeds Skiba: determinants of a successful career in academia","authors":"Gustav Feichtinger, Dieter Grass, Peter M. Kort, Andreas J. Novak, Andrea Seidl, Stefan Wrzaczek","doi":"10.1007/s10100-023-00889-7","DOIUrl":"https://doi.org/10.1007/s10100-023-00889-7","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136317173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-27DOI: 10.1007/s10100-023-00890-0
A. Zapata, A. M. Mármol, L. Monroy, M. A. Caraballo
Abstract This paper analyses the impact of altruism on the individual country goverments’ incentives to reduce global polluting emissions. The game theory perspective provides insights into the strategic decision-making processes of the governments regarding the problem of climate change. We propose a model of strategic interactions among countries in which each government is concerned with its own benefit, as well as with the benefits of all the other countries.The model is a vector-valued non-cooperative game that permits the representation of situations in which the preferences of the governments are incomplete and there is imprecision about the degrees of altruism. The focus is on the identification of the potential equilibria that will eventually be reached when the governments show different attitudes towards other countries or groups of countries. As a result, we show that the incorporation of altruism into the model produces equilibria with a positive effect on the reduction of emissions.
{"title":"Altruistic preferences in global emission games","authors":"A. Zapata, A. M. Mármol, L. Monroy, M. A. Caraballo","doi":"10.1007/s10100-023-00890-0","DOIUrl":"https://doi.org/10.1007/s10100-023-00890-0","url":null,"abstract":"Abstract This paper analyses the impact of altruism on the individual country goverments’ incentives to reduce global polluting emissions. The game theory perspective provides insights into the strategic decision-making processes of the governments regarding the problem of climate change. We propose a model of strategic interactions among countries in which each government is concerned with its own benefit, as well as with the benefits of all the other countries.The model is a vector-valued non-cooperative game that permits the representation of situations in which the preferences of the governments are incomplete and there is imprecision about the degrees of altruism. The focus is on the identification of the potential equilibria that will eventually be reached when the governments show different attitudes towards other countries or groups of countries. As a result, we show that the incorporation of altruism into the model produces equilibria with a positive effect on the reduction of emissions.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136261926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-27DOI: 10.1007/s10100-023-00881-1
Kolos Cs. Ágoston, Marianna E.-Nagy
Abstract The minimum sum-of-squares clusering is the most widely used clustering method. The minimum sum-of-squares clustering is usually solved by the heuristic KMEANS algorithm, which converges to a local optimum. A lot of effort has been made to solve such kind of problems, but a mixed integer linear programming formulation (MILP) is still missing. In this paper, we formulate MILP models. The advantage of MILP formulation is that users can extend the original problem with arbitrary linear constraints. We also present numerical results, we solve these models up to sample size of 150.
{"title":"Mixed integer linear programming formulation for K-means clustering problem","authors":"Kolos Cs. Ágoston, Marianna E.-Nagy","doi":"10.1007/s10100-023-00881-1","DOIUrl":"https://doi.org/10.1007/s10100-023-00881-1","url":null,"abstract":"Abstract The minimum sum-of-squares clusering is the most widely used clustering method. The minimum sum-of-squares clustering is usually solved by the heuristic KMEANS algorithm, which converges to a local optimum. A lot of effort has been made to solve such kind of problems, but a mixed integer linear programming formulation (MILP) is still missing. In this paper, we formulate MILP models. The advantage of MILP formulation is that users can extend the original problem with arbitrary linear constraints. We also present numerical results, we solve these models up to sample size of 150.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136311460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-13DOI: 10.1007/s10100-023-00883-z
Michael Manitz, Marc-Philip Piehl
Abstract Ensuring customer satisfaction is one of the main objectives of a call center. We focus on the question of how many agents are necessary and how they should be allocated to maintain a service level threshold and reduce the expected waiting time of the customers. In this paper, we consider a multistage call center that consists of a front and a back office, impatient customers, and an overflow mechanism. Based on the performance evaluation of such a system using a continuous-time Markov chain, a configuration of agents is determined using a binary search algorithm. We focus on structural insights, e.g., convexity conditions, to obtain a quick solution for the staffing problem. Since monotonicity does not always hold, the approach is heuristic. The numerical results show the performance of the algorithm. The influence of the fraction requiring second-level service in the back office and the impatience rate for the minimum number of agents is shown.
{"title":"A fast staffing algorithm for multistage call centers with impatient customers and time-dependent overflow","authors":"Michael Manitz, Marc-Philip Piehl","doi":"10.1007/s10100-023-00883-z","DOIUrl":"https://doi.org/10.1007/s10100-023-00883-z","url":null,"abstract":"Abstract Ensuring customer satisfaction is one of the main objectives of a call center. We focus on the question of how many agents are necessary and how they should be allocated to maintain a service level threshold and reduce the expected waiting time of the customers. In this paper, we consider a multistage call center that consists of a front and a back office, impatient customers, and an overflow mechanism. Based on the performance evaluation of such a system using a continuous-time Markov chain, a configuration of agents is determined using a binary search algorithm. We focus on structural insights, e.g., convexity conditions, to obtain a quick solution for the staffing problem. Since monotonicity does not always hold, the approach is heuristic. The numerical results show the performance of the algorithm. The influence of the fraction requiring second-level service in the back office and the impatience rate for the minimum number of agents is shown.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135853081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-12DOI: 10.1007/s10100-023-00886-w
Raouf Boucekkine, Fouad El Ouardighi, Konstantin Kogan
{"title":"Recycling of multi-source waste in an aggregate circular economy","authors":"Raouf Boucekkine, Fouad El Ouardighi, Konstantin Kogan","doi":"10.1007/s10100-023-00886-w","DOIUrl":"https://doi.org/10.1007/s10100-023-00886-w","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135968402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-30DOI: 10.1007/s10100-023-00884-y
Ana Klobučar Barišić, Robert Manger
{"title":"Solving the minimum-cost double Roman domination problem","authors":"Ana Klobučar Barišić, Robert Manger","doi":"10.1007/s10100-023-00884-y","DOIUrl":"https://doi.org/10.1007/s10100-023-00884-y","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136341455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：