Pub Date : 2021-02-03DOI: 10.1504/EJIE.2021.113508
Ertan Yakıcı, M. Karatas, Serhan Duran
In this study, we focus on the structure of the pre-positioning warehouse networks which have a great effect on the response to a disaster. We determine the pre-positioning warehouse network configuration of CARE International with a multi-objective approach using the recent decade data. In addition to the minimisation of the average response time of an item, we also consider the maximum response time and maximum water delivery time as additional objectives. After analysis of the non-dominated solutions, we conclude that CARE International should open a warehouse in Kenya and pre-position 39%-44% of all relief items other than tents to this location while starting to operate the Denmark warehouse instead of the Dubai warehouse. [Received: 20 March 2018; Revised: 12 September 2019; Accepted: 26 February 2020]
{"title":"A multi-objective approach in expanding the pre-positioning warehouse networks in humanitarian logistics","authors":"Ertan Yakıcı, M. Karatas, Serhan Duran","doi":"10.1504/EJIE.2021.113508","DOIUrl":"https://doi.org/10.1504/EJIE.2021.113508","url":null,"abstract":"In this study, we focus on the structure of the pre-positioning warehouse networks which have a great effect on the response to a disaster. We determine the pre-positioning warehouse network configuration of CARE International with a multi-objective approach using the recent decade data. In addition to the minimisation of the average response time of an item, we also consider the maximum response time and maximum water delivery time as additional objectives. After analysis of the non-dominated solutions, we conclude that CARE International should open a warehouse in Kenya and pre-position 39%-44% of all relief items other than tents to this location while starting to operate the Denmark warehouse instead of the Dubai warehouse. [Received: 20 March 2018; Revised: 12 September 2019; Accepted: 26 February 2020]","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47596810","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 : 2021-01-01DOI: 10.1504/EJIE.2021.10036443
Fadwa Oukhay, Ahmed Badreddine, T. Romdhane
{"title":"Towards a New Knowledge-based Framework for Integrated Quality Control Planning","authors":"Fadwa Oukhay, Ahmed Badreddine, T. Romdhane","doi":"10.1504/EJIE.2021.10036443","DOIUrl":"https://doi.org/10.1504/EJIE.2021.10036443","url":null,"abstract":"","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66756351","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 : 2021-01-01DOI: 10.1504/EJIE.2021.114001
W. Zahrouni, H. Kamoun
{"title":"Scheduling in robotic cells with time window constraints","authors":"W. Zahrouni, H. Kamoun","doi":"10.1504/EJIE.2021.114001","DOIUrl":"https://doi.org/10.1504/EJIE.2021.114001","url":null,"abstract":"","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66756426","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 : 2021-01-01DOI: 10.1504/EJIE.2021.10037978
Milad Mohammadi, Hadi Shahmoradi, M. Esmaelian, A. Sobhani
: This paper schedules capacitated parallel machines of a real production system by considering different quantities of production and processing times required to complete customer orders. A new mixed linear programming model is developed according to the concept of constrained vehicle routing problems to have a complete schedule for machines by determining the sequence of both jobs and idle times for each machine. The optimisation model minimises the total cost of the production system, including tardiness, earliness and sequence-dependent setup costs. A constraint programming (CP) model and a meta-heuristic hybrid algorithm are also developed to compare their results with the mixed linear programming model. The numerical findings show that the total cost estimated by the mixed integer programming model is 10%–13% better (lower) than the ones estimated by the
{"title":"Scheduling the Capacitated Identical Parallel Machines Problem: A New Formulation with Sequence-Dependent Setup Costs and Different Due Dates","authors":"Milad Mohammadi, Hadi Shahmoradi, M. Esmaelian, A. Sobhani","doi":"10.1504/EJIE.2021.10037978","DOIUrl":"https://doi.org/10.1504/EJIE.2021.10037978","url":null,"abstract":": This paper schedules capacitated parallel machines of a real production system by considering different quantities of production and processing times required to complete customer orders. A new mixed linear programming model is developed according to the concept of constrained vehicle routing problems to have a complete schedule for machines by determining the sequence of both jobs and idle times for each machine. The optimisation model minimises the total cost of the production system, including tardiness, earliness and sequence-dependent setup costs. A constraint programming (CP) model and a meta-heuristic hybrid algorithm are also developed to compare their results with the mixed linear programming model. The numerical findings show that the total cost estimated by the mixed integer programming model is 10%–13% better (lower) than the ones estimated by the","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66756417","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 : 2021-01-01DOI: 10.1504/ejie.2021.10031882
R. Kia, Mohsen Lashgari, F. Jolai
{"title":"Robust optimization to design a dynamic cellular manufacturing system integrating group layout and workers assignment","authors":"R. Kia, Mohsen Lashgari, F. Jolai","doi":"10.1504/ejie.2021.10031882","DOIUrl":"https://doi.org/10.1504/ejie.2021.10031882","url":null,"abstract":"","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66756256","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 : 2021-01-01DOI: 10.1504/EJIE.2021.10036774
Seong Wook Hwang, Sang Jin Kweon, Seokgi Lee
{"title":"An Integrated Inventory and Distribution Problem for Alternative Fuel: a Matheuristic Approach","authors":"Seong Wook Hwang, Sang Jin Kweon, Seokgi Lee","doi":"10.1504/EJIE.2021.10036774","DOIUrl":"https://doi.org/10.1504/EJIE.2021.10036774","url":null,"abstract":"","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66756378","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 : 2021-01-01DOI: 10.1504/EJIE.2021.10032396
Ali Sayyah, A. Pooya, R. Kazemzadeh
{"title":"A New Multiobjective-Multicriteria Model for Determining Physical Asset Management Strategy Based on Maintenance and Procurement Factors","authors":"Ali Sayyah, A. Pooya, R. Kazemzadeh","doi":"10.1504/EJIE.2021.10032396","DOIUrl":"https://doi.org/10.1504/EJIE.2021.10032396","url":null,"abstract":"","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66756295","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 : 2020-09-18DOI: 10.1504/ejie.2020.109906
Yassine Adouani, B. Jarboui, Malek Masmoudi
This paper introduces a new variant of the knapsack problem with setup (KPS). We refer to it as the generalised multiple knapsack problem with setup (GMKPS). GMKPS originates from industrial production problems where the items are divided into classes and processed in multiple periods. We refer to the particular case where items from the same class cannot be processed in more than one period as the multiple knapsack problem with setup (MKPS). First, we provide mathematical formulations of GMKPS and MKPS and provide an upper bound expression for the knapsack problem. We then propose a matheuristic that combines variable neighbourhood descent (VND) with integer programming (IP). We consider local search techniques to assign classes to knapsacks and apply the IP to select the items in each knapsack. Computational experiments on randomly generated instances show the efficiency of our matheuristic in comparison to the direct use of a commercial solver. [Received: 4 March 2018; Revised: 1 June 2019; Revised: 12 July 2019; Revised: 22 November 2019; Accepted: 6 January 2020]
{"title":"Efficient matheuristic for the generalised multiple knapsack problem with setup","authors":"Yassine Adouani, B. Jarboui, Malek Masmoudi","doi":"10.1504/ejie.2020.109906","DOIUrl":"https://doi.org/10.1504/ejie.2020.109906","url":null,"abstract":"This paper introduces a new variant of the knapsack problem with setup (KPS). We refer to it as the generalised multiple knapsack problem with setup (GMKPS). GMKPS originates from industrial production problems where the items are divided into classes and processed in multiple periods. We refer to the particular case where items from the same class cannot be processed in more than one period as the multiple knapsack problem with setup (MKPS). First, we provide mathematical formulations of GMKPS and MKPS and provide an upper bound expression for the knapsack problem. We then propose a matheuristic that combines variable neighbourhood descent (VND) with integer programming (IP). We consider local search techniques to assign classes to knapsacks and apply the IP to select the items in each knapsack. Computational experiments on randomly generated instances show the efficiency of our matheuristic in comparison to the direct use of a commercial solver. [Received: 4 March 2018; Revised: 1 June 2019; Revised: 12 July 2019; Revised: 22 November 2019; Accepted: 6 January 2020]","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2020-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ejie.2020.109906","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42765827","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 : 2020-09-18DOI: 10.1504/ejie.2020.10030374
Merve Sahin, B. Dengiz, K. D. Atalay
Due to the complexity of today's engineering systems, accurate system performance analysis is important to obtain a more productive system design. This study introduces a new approach to obtain a new system design considering system availability to increase its productivity in a more consistent and logical manner. To obtain more productive system design, both fuzzy availability analysis and simulation are used together. The conventional simulation modelling can be used to analyse the system behaviour considering failure and repair data to predict system throughput. This approach solves the problems of scarce data for failures and repairs in the system. The fuzzy availability analysis is used to consider system failures and repairs based on fuzzy set theory. In other words, the integration of simulation results and fuzzy system availability allows for analysing system performance to improve system productivity with new system design even though system failure and repair data are scarce. This new approach has been applied to improve system productivity in a battery production company in Turkey. The analysis results show that this new approach is able to analyse system performance accurately and improve system productivity with a new system design. [Received: 26 November 2018; Accepted: 17 December 2019]
{"title":"Performance enhancement of production systems using fuzzy based availability analysis and simulation method","authors":"Merve Sahin, B. Dengiz, K. D. Atalay","doi":"10.1504/ejie.2020.10030374","DOIUrl":"https://doi.org/10.1504/ejie.2020.10030374","url":null,"abstract":"Due to the complexity of today's engineering systems, accurate system performance analysis is important to obtain a more productive system design. This study introduces a new approach to obtain a new system design considering system availability to increase its productivity in a more consistent and logical manner. To obtain more productive system design, both fuzzy availability analysis and simulation are used together. The conventional simulation modelling can be used to analyse the system behaviour considering failure and repair data to predict system throughput. This approach solves the problems of scarce data for failures and repairs in the system. The fuzzy availability analysis is used to consider system failures and repairs based on fuzzy set theory. In other words, the integration of simulation results and fuzzy system availability allows for analysing system performance to improve system productivity with new system design even though system failure and repair data are scarce. This new approach has been applied to improve system productivity in a battery production company in Turkey. The analysis results show that this new approach is able to analyse system performance accurately and improve system productivity with a new system design. [Received: 26 November 2018; Accepted: 17 December 2019]","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2020-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44865278","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 : 2020-07-20DOI: 10.1504/ejie.2020.10030254
Karima Amrouche, Mourad Boudhar, Nazim Sami
This paper addresses the chain-reentrant flow shop scheduling problem with two machines and n non-preemptive jobs in the presence of the no-wait constraint; we assume that each job passes from the first machine to the second and returns back to the first machine. The objective is to minimise the makespan. The general problem is NP-hard in the strong sense. Based on a dynamic programming algorithm, we prove that the problem is polynomially solvable when the execution order of the jobs through the machines is a fixed permutation. For the resolution of the general problem, we propose a linear mathematical model, local search heuristics, a simulated annealing metaheuristic and lower bounds with numerical experiments. [Received: 8 February 2019; Revised: 19 June 2019; Revised: 26 August 2019; Revised: 8 October 2019; Revised: 9 November 2019; Accepted: 11 November 2019]
{"title":"Two-machine chain-reentrant ow shop with the no-wait constraint","authors":"Karima Amrouche, Mourad Boudhar, Nazim Sami","doi":"10.1504/ejie.2020.10030254","DOIUrl":"https://doi.org/10.1504/ejie.2020.10030254","url":null,"abstract":"This paper addresses the chain-reentrant flow shop scheduling problem with two machines and n non-preemptive jobs in the presence of the no-wait constraint; we assume that each job passes from the first machine to the second and returns back to the first machine. The objective is to minimise the makespan. The general problem is NP-hard in the strong sense. Based on a dynamic programming algorithm, we prove that the problem is polynomially solvable when the execution order of the jobs through the machines is a fixed permutation. For the resolution of the general problem, we propose a linear mathematical model, local search heuristics, a simulated annealing metaheuristic and lower bounds with numerical experiments. [Received: 8 February 2019; Revised: 19 June 2019; Revised: 26 August 2019; Revised: 8 October 2019; Revised: 9 November 2019; Accepted: 11 November 2019]","PeriodicalId":51047,"journal":{"name":"European Journal of Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47914699","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
扫码关注我们
求助内容：
应助结果提醒方式：