Pub Date : 2021-05-07DOI: 10.1504/EJIE.2021.116140
Rita Maria Difrancesco, P. Meena, R. Tibrewala
Events like the recent COVID-19 create major disruptions in global supply chains. Companies find it difficult to manage business continuity under supply uncertainties and disruptions. This paper investigates the buyer's optimal ordering decisions under stochastic demand, supply uncertainty, and disruption risks. We consider a two-echelon supply chain consisting of a single buyer and two suppliers. The main supplier is cheaper, but exposed to the risks of random yield and disruption. The backup supplier is perfectly reliable, but relatively expensive. An analytical model is developed using contract-based mechanisms considering the risks of demand uncertainty, supply disruption, and random yield. Two typologies of contracts with suppliers are considered, namely, risks sharing contract and buyback contract. A numerical study is performed to explore the effects of different parameters on the supply chain members' profits, providing guidelines for managers regarding how the supply chain's risks and demand uncertainty influence the ordering decisions. [Received: 5 November 2019; Accepted: 22 August 2020]
{"title":"Buyback and risk-sharing contracts to mitigate the supply and demand disruption risks","authors":"Rita Maria Difrancesco, P. Meena, R. Tibrewala","doi":"10.1504/EJIE.2021.116140","DOIUrl":"https://doi.org/10.1504/EJIE.2021.116140","url":null,"abstract":"Events like the recent COVID-19 create major disruptions in global supply chains. Companies find it difficult to manage business continuity under supply uncertainties and disruptions. This paper investigates the buyer's optimal ordering decisions under stochastic demand, supply uncertainty, and disruption risks. We consider a two-echelon supply chain consisting of a single buyer and two suppliers. The main supplier is cheaper, but exposed to the risks of random yield and disruption. The backup supplier is perfectly reliable, but relatively expensive. An analytical model is developed using contract-based mechanisms considering the risks of demand uncertainty, supply disruption, and random yield. Two typologies of contracts with suppliers are considered, namely, risks sharing contract and buyback contract. A numerical study is performed to explore the effects of different parameters on the supply chain members' profits, providing guidelines for managers regarding how the supply chain's risks and demand uncertainty influence the ordering decisions. [Received: 5 November 2019; Accepted: 22 August 2020]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"2004 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125796005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-30DOI: 10.1504/EJIE.2021.115171
P. S. Bicakci, Tusan Derya, Imdat Kara
Order acceptance and scheduling problem arises when there is limited capacity to process all orders in a make-to-order environment. The paper examines the identical parallel machines order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines. The extant literature is deeply researched, and it is concluded that well-designed mathematical formulations are still necessitated in this area. Therefore, a new formulation is proposed for this problem and a recent formulation is chosen from the literature in order to make the comparison. An extensive computational analysis is conducted to test the performance of the formulations. The proposed formulation outperformed the existing one in terms of run times and the number of optimal values. Besides, a variable neighbourhood search-based simulated annealing algorithm is propounded to solve large-sized instances. As a result, it is observed that the heuristic algorithm can solve large-sized instances effectively in a very short span of time. [Received: 18 December 2019; Accepted: 25 April 2020]
{"title":"Solution approaches for the parallel machine order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines","authors":"P. S. Bicakci, Tusan Derya, Imdat Kara","doi":"10.1504/EJIE.2021.115171","DOIUrl":"https://doi.org/10.1504/EJIE.2021.115171","url":null,"abstract":"Order acceptance and scheduling problem arises when there is limited capacity to process all orders in a make-to-order environment. The paper examines the identical parallel machines order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines. The extant literature is deeply researched, and it is concluded that well-designed mathematical formulations are still necessitated in this area. Therefore, a new formulation is proposed for this problem and a recent formulation is chosen from the literature in order to make the comparison. An extensive computational analysis is conducted to test the performance of the formulations. The proposed formulation outperformed the existing one in terms of run times and the number of optimal values. Besides, a variable neighbourhood search-based simulated annealing algorithm is propounded to solve large-sized instances. As a result, it is observed that the heuristic algorithm can solve large-sized instances effectively in a very short span of time. [Received: 18 December 2019; Accepted: 25 April 2020]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114410848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-03-23DOI: 10.1504/EJIE.2021.114014
R. Su, Chia-Huang Wu, Dong-Yuh Yang
The achievable capacity index (ACI) can measure the profitability of a newsboy-type product with probabilistic distributed demand. This criterion has been employed to deal with the problem of profitability evaluation by implementing statistical hypothesis testing. However, due to sampling errors, the point estimate of ACI probably overestimates the profitability. To this end, we derive a lower confidence bound of ACI (LCBA) to give a conservative evaluation of profitability. Since the complex sampling distribution of ACI makes it difficult to obtain an explicit closed-form expression of LCBA, we characterise the relationship between LCBA and estimator of ACI under given confidence level and sample size. A computational algorithm is proposed to obtain LCBA. Extensive numerical results of LCBA for various sample sizes, confidence levels and estimates are tabulated. Finally, we illustrate the practicality and applicability of the proposed method in an application example. Some managerial insights are also discussed. [Received: 21 May 2019; Accepted: 7 April 2020]
{"title":"Conservative profitability evaluation for a newsboy-type product based on achievable capacity index","authors":"R. Su, Chia-Huang Wu, Dong-Yuh Yang","doi":"10.1504/EJIE.2021.114014","DOIUrl":"https://doi.org/10.1504/EJIE.2021.114014","url":null,"abstract":"The achievable capacity index (ACI) can measure the profitability of a newsboy-type product with probabilistic distributed demand. This criterion has been employed to deal with the problem of profitability evaluation by implementing statistical hypothesis testing. However, due to sampling errors, the point estimate of ACI probably overestimates the profitability. To this end, we derive a lower confidence bound of ACI (LCBA) to give a conservative evaluation of profitability. Since the complex sampling distribution of ACI makes it difficult to obtain an explicit closed-form expression of LCBA, we characterise the relationship between LCBA and estimator of ACI under given confidence level and sample size. A computational algorithm is proposed to obtain LCBA. Extensive numerical results of LCBA for various sample sizes, confidence levels and estimates are tabulated. Finally, we illustrate the practicality and applicability of the proposed method in an application example. Some managerial insights are also discussed. [Received: 21 May 2019; Accepted: 7 April 2020]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115700436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-03DOI: 10.1504/EJIE.2021.10034936
Weihua Liu, Wanying Wei, D. Zhu
This paper builds a logistics service supply chain consisting of a logistics service integrator (LSI) and a functional logistics service provider (FLSP), where they collaborate with a reciprocity contract. We aim to analyse the impact of reciprocity on the supply chain members' two-stage service capability procurement decisions under demand updating through a multi-method, combining game theory and a case study. We find that a reciprocity contract could provide a win-win situation and coordinate the supply chain when reciprocity factors are in an appropriate range. Moreover, the reciprocal behaviour of LSI can promote the reduction of wholesale prices, and the reciprocal behaviour of FLSP will increase the purchasing quantity as well as bring forward the purchasing time point of LSI. Lastly, the reciprocal behaviour of both parties is mutually reinforcing; that is, when one party increases its own reciprocity factor, the other party also increases its reciprocity factor as a return. [Received: 30 September 2018; Accepted: 11 February 2020]
{"title":"Service capacity procurement in Logistics service supply chain with demand updating and reciprocal behavior","authors":"Weihua Liu, Wanying Wei, D. Zhu","doi":"10.1504/EJIE.2021.10034936","DOIUrl":"https://doi.org/10.1504/EJIE.2021.10034936","url":null,"abstract":"This paper builds a logistics service supply chain consisting of a logistics service integrator (LSI) and a functional logistics service provider (FLSP), where they collaborate with a reciprocity contract. We aim to analyse the impact of reciprocity on the supply chain members' two-stage service capability procurement decisions under demand updating through a multi-method, combining game theory and a case study. We find that a reciprocity contract could provide a win-win situation and coordinate the supply chain when reciprocity factors are in an appropriate range. Moreover, the reciprocal behaviour of LSI can promote the reduction of wholesale prices, and the reciprocal behaviour of FLSP will increase the purchasing quantity as well as bring forward the purchasing time point of LSI. Lastly, the reciprocal behaviour of both parties is mutually reinforcing; that is, when one party increases its own reciprocity factor, the other party also increases its reciprocity factor as a return. [Received: 30 September 2018; Accepted: 11 February 2020]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131702100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-03DOI: 10.1504/ejie.2021.10030376
Qing-Mi Hu
This paper addresses the classical single and multiple allocation hub location problems with fully interconnected hubs, in which the balanced round-trip flows on hub links are considered in the strategic decision making process. The use of balanced round-trip flows on hub links is motivated by the need to decrease the empty-trip rate of vehicles and increase the full-load rate of vehicles. Mixed-integer programming models are presented for single and multiple allocation versions of the problems. Numerical experiments with the CAB and AP datasets are performed to analyse the impacts of balanced flows on the network configurations and the utilisation of service resources. Experimental results show that the number of located hubs tends to decrease with a decrease in the allowable unbalanced round-trip degree of the hub link flows. The utilisation rate of transportation resources can be significantly improved with a small increase in the traditional operating cost. Moreover, a better modelling of economies of scale can be achieved when considering balanced flows. [Received: 22 September 2019; Accepted: 15 March 2020]
{"title":"Hub location problem with balanced round-trip flows on hub links","authors":"Qing-Mi Hu","doi":"10.1504/ejie.2021.10030376","DOIUrl":"https://doi.org/10.1504/ejie.2021.10030376","url":null,"abstract":"This paper addresses the classical single and multiple allocation hub location problems with fully interconnected hubs, in which the balanced round-trip flows on hub links are considered in the strategic decision making process. The use of balanced round-trip flows on hub links is motivated by the need to decrease the empty-trip rate of vehicles and increase the full-load rate of vehicles. Mixed-integer programming models are presented for single and multiple allocation versions of the problems. Numerical experiments with the CAB and AP datasets are performed to analyse the impacts of balanced flows on the network configurations and the utilisation of service resources. Experimental results show that the number of located hubs tends to decrease with a decrease in the allowable unbalanced round-trip degree of the hub link flows. The utilisation rate of transportation resources can be significantly improved with a small increase in the traditional operating cost. Moreover, a better modelling of economies of scale can be achieved when considering balanced flows. [Received: 22 September 2019; Accepted: 15 March 2020]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121033025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"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.10030237
T. Nawaz, D. Han
The use of efficient sampling designs can play a vital role to enhance the efficiency of the control charts for improved process monitoring. In this paper, the neoteric ranked set sampling scheme (NRSS) is used to design combined Shewhart-CUSUM (CSCUSUM) and Shewhart-EWMA (CSEWMA) control charts for monitoring of the process location with an aim to enhance the shift detection ability of these charts. Monte Carlo simulations are used to obtain the run lengths profiles of the proposed charts. The performance of the proposed charts is compared with their competing control charts using average run length, the standard deviation of run length, median run length and extra quadratic loss (EQL) as performance metrics. The proposed control charts emerged as more sensitive and in-control robust as compare to the existing charts. A real industrial dataset is used to demonstrate the implementation of the proposed charts for the practitioners. [Received: 11 May 2019; Accepted: 17 December 2019]
{"title":"Neoteric ranked set sampling based combined Shewhart-CUSUM and Shewhart-EWMA control charts for monitoring the process location","authors":"T. Nawaz, D. Han","doi":"10.1504/ejie.2020.10030237","DOIUrl":"https://doi.org/10.1504/ejie.2020.10030237","url":null,"abstract":"The use of efficient sampling designs can play a vital role to enhance the efficiency of the control charts for improved process monitoring. In this paper, the neoteric ranked set sampling scheme (NRSS) is used to design combined Shewhart-CUSUM (CSCUSUM) and Shewhart-EWMA (CSEWMA) control charts for monitoring of the process location with an aim to enhance the shift detection ability of these charts. Monte Carlo simulations are used to obtain the run lengths profiles of the proposed charts. The performance of the proposed charts is compared with their competing control charts using average run length, the standard deviation of run length, median run length and extra quadratic loss (EQL) as performance metrics. The proposed control charts emerged as more sensitive and in-control robust as compare to the existing charts. A real industrial dataset is used to demonstrate the implementation of the proposed charts for the practitioners. [Received: 11 May 2019; Accepted: 17 December 2019]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115832194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"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.10032196
Binghai Zhou, Xiu-mei Liao
In order to improve the performance of large manufacturing enterprises, besides the adoption of new technologies, it is also feasible to efficiently schedule logistics equipment such as cranes, which costs much less since only software changes are involved. In this research, the objectives of minimising total waiting cost and total delay cost are optimised simultaneously when executing crane-delivery tasks in factories. Given the time-space constraints and NP-hard nature of the problem, a generalised opposition-based learning (GOBL) mechanism and two problem-based searching strategies are developed and fused into the multi-objective differential evolution approach, namely GOMODE. The introduction of GOBL mechanism enables the proposed algorithm to search in a more extensive solution space, which improves the population diversity and avoids the premature problem. The performance of the GOMODE has been compared with classical multi-objective optimisation algorithms. The experimental results indicate that the GOMODE achieves a better performance both on solutions' quality and diversity. [Received: 11 December 2018; Accepted: 23 December 2019]
{"title":"An efficient generalised opposition-based multi-objective optimisation method for factory cranes with time-space constraints","authors":"Binghai Zhou, Xiu-mei Liao","doi":"10.1504/ejie.2020.10032196","DOIUrl":"https://doi.org/10.1504/ejie.2020.10032196","url":null,"abstract":"In order to improve the performance of large manufacturing enterprises, besides the adoption of new technologies, it is also feasible to efficiently schedule logistics equipment such as cranes, which costs much less since only software changes are involved. In this research, the objectives of minimising total waiting cost and total delay cost are optimised simultaneously when executing crane-delivery tasks in factories. Given the time-space constraints and NP-hard nature of the problem, a generalised opposition-based learning (GOBL) mechanism and two problem-based searching strategies are developed and fused into the multi-objective differential evolution approach, namely GOMODE. The introduction of GOBL mechanism enables the proposed algorithm to search in a more extensive solution space, which improves the population diversity and avoids the premature problem. The performance of the GOMODE has been compared with classical multi-objective optimisation algorithms. The experimental results indicate that the GOMODE achieves a better performance both on solutions' quality and diversity. [Received: 11 December 2018; Accepted: 23 December 2019]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125328094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"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.109899
João Faria, M. Araújo, E. Demeulemeester, Anabela Tereso
Project management still faces a wide gap separating theory from practice, especially regarding the robustness of the generated project schedules facing the omnipresence of uncertainty. A new approach to deal with uncertainty is presented to explore slack that might exist in a given project schedule. We propose that renewable resources' capacity to perform work can be increased so that they can perform additional work in a time unit or can be decreased with the consequent reduction on the performed work. This possibility combined with the slack that some activities have in a specific schedule can be used to absorb deviations that might occur during a project's execution. When a critical activity is about to have its duration increased, slowing down other non-critical activities by putting their resources in a decreased work mode enables the activity to still be executed within time by using resources in an increased working mode. [Received: 14 February 2018; Revised: 2 January 2019; Revised: 8 June 2019; Accepted: 17 November 2019]
{"title":"Project management under uncertainty: using flexible resource management to exploit schedule flexibility","authors":"João Faria, M. Araújo, E. Demeulemeester, Anabela Tereso","doi":"10.1504/ejie.2020.109899","DOIUrl":"https://doi.org/10.1504/ejie.2020.109899","url":null,"abstract":"Project management still faces a wide gap separating theory from practice, especially regarding the robustness of the generated project schedules facing the omnipresence of uncertainty. A new approach to deal with uncertainty is presented to explore slack that might exist in a given project schedule. We propose that renewable resources' capacity to perform work can be increased so that they can perform additional work in a time unit or can be decreased with the consequent reduction on the performed work. This possibility combined with the slack that some activities have in a specific schedule can be used to absorb deviations that might occur during a project's execution. When a critical activity is about to have its duration increased, slowing down other non-critical activities by putting their resources in a decreased work mode enables the activity to still be executed within time by using resources in an increased working mode. [Received: 14 February 2018; Revised: 2 January 2019; Revised: 8 June 2019; Accepted: 17 November 2019]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127645431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-08DOI: 10.1504/ejie.2020.10030238
Xiyang Hou, Yongjiang Guo, P. Cao
In this paper, we consider a manufacturer with limited production capacity producing multiple kinds of independent products, such that each kind of product is sold by a distinct retailer who is offered a commission production contract with revenue sharing by the manufacturer. We study the contract in the centralised and decentralised systems respectively. Under certain conditions of price elasticities and cost fractions, we show the uniqueness of optimal revenue share for all products. Moreover, by comparing both systems with same capacity constraint, we find that at least one retailer's price in the centralised system is higher than that of the decentralised system, and the order quantity for that retailer is lower under some conditions. As a consequence, the decentralised system's profit is always higher than the centralised system's profit under that condition. Also, the retailers' optimal prices (resp. order quantities) are increasing (resp. decreasing) in production capacity of the manufacturer, whereas the manufacturer's expected profit is increasing in its production capacity in both systems. Finally, we conduct numerical study to justify our theoretical results, and examine the effect of processing cost on both systems' profits, and the effect of demand uncertainty on the optimal prices and order quantities. [Received 22 May 2018; Accepted 28 October 2019]
{"title":"Commission production contracts with revenue sharing for a capacitated manufacturer and multiple retailers","authors":"Xiyang Hou, Yongjiang Guo, P. Cao","doi":"10.1504/ejie.2020.10030238","DOIUrl":"https://doi.org/10.1504/ejie.2020.10030238","url":null,"abstract":"In this paper, we consider a manufacturer with limited production capacity producing multiple kinds of independent products, such that each kind of product is sold by a distinct retailer who is offered a commission production contract with revenue sharing by the manufacturer. We study the contract in the centralised and decentralised systems respectively. Under certain conditions of price elasticities and cost fractions, we show the uniqueness of optimal revenue share for all products. Moreover, by comparing both systems with same capacity constraint, we find that at least one retailer's price in the centralised system is higher than that of the decentralised system, and the order quantity for that retailer is lower under some conditions. As a consequence, the decentralised system's profit is always higher than the centralised system's profit under that condition. Also, the retailers' optimal prices (resp. order quantities) are increasing (resp. decreasing) in production capacity of the manufacturer, whereas the manufacturer's expected profit is increasing in its production capacity in both systems. Finally, we conduct numerical study to justify our theoretical results, and examine the effect of processing cost on both systems' profits, and the effect of demand uncertainty on the optimal prices and order quantities. [Received 22 May 2018; Accepted 28 October 2019]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115501237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-08DOI: 10.1504/ejie.2020.10029433
Elif Elçin Günay, Ufuk Kula
In mixed-model automobile assembly lines, paint defective vehicles are the main reason for unintentional sequence alteration that stirs up the production sequence so that resequencing is required. This study aims to decide optimal spare vehicles that are held in the mix-bank buffer to be replaced instead of defective vehicles in order to regain the production sequence. We develop a hybrid solution methodology in which optimal spare vehicle content is determined by genetic algorithm (GA) and the releasing order of the vehicles to final assembly (FA) are decided by stochastic mixed integer programming (MIP) model. In addition to discussing the efficiency of the hybrid model, the following insights were gained: 1) not only FA but also paint shop constraints should be considered in production sequence determination when mix-bank buffer is efficiently used; 2) the decrease in defect rate improves sequence restoration linearly; 3) effect of an additional lane on SSAR increase is diminishing. [Received: 22 December 2018; Accepted: 28 October 2019]
{"title":"A HYBRID MODEL FOR MIX-BANK BUFFER CONTENT DETERMINATION IN AUTOMOBILE INDUSTRY","authors":"Elif Elçin Günay, Ufuk Kula","doi":"10.1504/ejie.2020.10029433","DOIUrl":"https://doi.org/10.1504/ejie.2020.10029433","url":null,"abstract":"In mixed-model automobile assembly lines, paint defective vehicles are the main reason for unintentional sequence alteration that stirs up the production sequence so that resequencing is required. This study aims to decide optimal spare vehicles that are held in the mix-bank buffer to be replaced instead of defective vehicles in order to regain the production sequence. We develop a hybrid solution methodology in which optimal spare vehicle content is determined by genetic algorithm (GA) and the releasing order of the vehicles to final assembly (FA) are decided by stochastic mixed integer programming (MIP) model. In addition to discussing the efficiency of the hybrid model, the following insights were gained: 1) not only FA but also paint shop constraints should be considered in production sequence determination when mix-bank buffer is efficiently used; 2) the decrease in defect rate improves sequence restoration linearly; 3) effect of an additional lane on SSAR increase is diminishing. [Received: 22 December 2018; Accepted: 28 October 2019]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128848560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}