Template-Type: ReDIF-Article 1.0 Author-Name: Taha Keshavarz Author-X-Name-First: Taha Author-X-Name-Last: Keshavarz Author-Name: Nasser Salmasi Author-X-Name-First: Nasser Author-X-Name-Last: Salmasi Author-Name: Mohsen Varmazyar Author-X-Name-First: Mohsen Author-X-Name-Last: Varmazyar Title: Flowshop sequence-dependent group scheduling with minimisation of weighted earliness and tardiness Abstract: In this research, we approach the flowshop sequence-dependent group scheduling problem with minimisation of total weighted earliness and tardiness as the objective for the first time. A mixed integer linear programming model is developed to solve the problem optimally. Since the proposed research problem is proven to be NP-hard, a hybrid meta-heuristic algorithm based on the particle swarm optimisation (PSO) algorithm, enhanced with neighbourhood search is developed to heuristically solve the problem. Since the objective is a non-regular, a timing algorithm is developed to find the best schedule for each sequence provided by the metaheuristic algorithm. A lower bounding method is also developed by reformulating the problem as a Dantzig-Wolf decomposition model to evaluate the performance of the proposed PSO algorithm. The computational results, based on using available test problems in the literature, demonstrate that the proposed PSO algorithm and the lower bounding method are quite effective, especially in the instances with loose due date. [Received: 17 February 2018; Revised: 27 July 2018; Accepted: 25 August 2018] Journal: European J. of Industrial Engineering Pages: 54-80 Issue: 1 Volume: 13 Year: 2019 Keywords: earliness; tardiness; sequence-dependent setup time; group scheduling; Dantzig-Wolf decomposition; particle swarm optimisation; PSO. File-URL: http://www.inderscience.com/link.php?id=97920 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:1:p:54-80 Template-Type: ReDIF-Article 1.0 Author-Name: Zhaobo Chen Author-X-Name-First: Zhaobo Author-X-Name-Last: Chen Author-Name: Chunying Tian Author-X-Name-First: Chunying Author-X-Name-Last: Tian Author-Name: Ding Zhang Author-X-Name-First: Ding Author-X-Name-Last: Zhang Title: Supply chains competition with vertical and horizontal information sharing Abstract: This paper studies the incentive for vertical and horizontal information sharing in two competing supply chains with uncertain demand. Retailers obtain the uncertain demand information from the market, and can exchange the private information with each other. We investigate the equilibrium information sharing arrangement in the competing supply chains and discuss how expected payoffs of the firms and the supply chains is impacted by horizontal information sharing. The results show that no vertical information sharing in both supply chains is the unique equilibrium in one-shot game, and horizontal information sharing won't affect the vertical information sharing strategy for the competing supply chains. However, horizontal information sharing will increase the supply chain profits if the competition between two supply chains is sufficiently less intense. Furthermore, we analyse the conditions of prisoner's dilemma for the equilibrium information sharing arrangement and the perfect Nash equilibrium of the repeated game. [Received: 9 November 2015; Revised: 29 September 2017; Revised: 16 June 2018; Accepted: 21 August 2018] Journal: European J. of Industrial Engineering Pages: 29-53 Issue: 1 Volume: 13 Year: 2019 Keywords: supply chain management; supply chain competition; information sharing. File-URL: http://www.inderscience.com/link.php?id=97921 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:1:p:29-53 Template-Type: ReDIF-Article 1.0 Author-Name: Kateryna Czerniachowska Author-X-Name-First: Kateryna Author-X-Name-Last: Czerniachowska Title: Scheduling TV advertisements via genetic algorithm Abstract: Television advertising is vital to the television industry and is one of the most popular ways for advertisers to increase sales. This paper discusses the problem of scheduling TV advertisements according to each advertisers' need and budget limitations, with the objective of maximising total viewership. The proposed solution is the genetic algorithm, and its efficiency has been evaluated using list and random-list algorithms during long (one month) and short (one week) advertising campaign periods. Computational results show that this algorithm can obtain satisfactory results for real-world test problems, based on data from a marketing research company. [Received: 30 November 2017; Revised: 14 April 2018; Revised: 15 September 2018; Revised: 20 September 2018; Accepted: 22 September 2018] Journal: European J. of Industrial Engineering Pages: 81-116 Issue: 1 Volume: 13 Year: 2019 Keywords: scheduling; media planning; advertising; genetic algorithm; heuristics. File-URL: http://www.inderscience.com/link.php?id=97926 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:1:p:81-116 Template-Type: ReDIF-Article 1.0 Author-Name: Jean-Claude Malela-Majika Author-X-Name-First: Jean-Claude Author-X-Name-Last: Malela-Majika Author-Name: Eeva Maria Rapoo Author-X-Name-First: Eeva Maria Author-X-Name-Last: Rapoo Title: Side-sensitive synthetic double sampling X control charts Abstract: This paper develops two new synthetic double sampling (SDS) charts based on the revised side-sensitive (RSS) and modified side-sensitive (MSS) schemes for monitoring the location process parameter. In this paper, we first give the operation of the proposed charts and secondly, the exact form expression of the probability of declaring a sampling stage as 'conforming'. Thirdly, we investigate the zero-state and steady-state performances of the proposed charts in terms of the out-of-control average run-length, average sample size, average number of observations to signal and average extra quadratic loss. Finally, we compare the performance of the new charts with some well-known charts. It is observed that the proposed charts have attractive zero-state and steady-state properties and outperform the existing SDS chart and all other competing charts in many situations. An example of a real-life application is given to facilitate the design and implementation of the proposed charts. [Received: 28 February 2017; Revised: 14 March 2018; Revised: 28 August 2018; Accepted: 4 October 2018] Journal: European J. of Industrial Engineering Pages: 117-148 Issue: 1 Volume: 13 Year: 2019 Keywords: average run-length; average sample size; extra quadratic loss function; side-sensitive scheme; steady-state mode; synthetic double sampling scheme; zero-state mode. File-URL: http://www.inderscience.com/link.php?id=97934 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:1:p:117-148 Template-Type: ReDIF-Article 1.0 Author-Name: J. Sebastian Arockia Jenifer Author-X-Name-First: J. Sebastian Arockia Author-X-Name-Last: Jenifer Author-Name: B. Sivakumar Author-X-Name-First: B. Author-X-Name-Last: Sivakumar Title: A continuous review (s, S) inventory system with postponed demands at service facility Abstract: In this article, we present a continuous review (<i>s</i>, <i>S</i>) inventory system with a service facility consisting of finite waiting hall (capacity <i>N</i>) and a single server. The customers arrive according to a Poisson process. The individual customer's unit demand is satisfied after a random time of service, which is assumed to be exponential. An arriving customer, who finds the waiting hall is full, enters into the pool of infinite size or leaves the system which is according to a Bernolli trial. The joint probability distribution of the number of customers in the pool, number of customers in the waiting hall and the inventory level is obtained in the steady-state case. Various stationary system performance measures are computed and total expected cost rate is calculated. The results are illustrated numerically. [Received: 8 January 2017; Revised: 28 February 2018; Accepted: 30 July 2018] Journal: European J. of Industrial Engineering Pages: 1-28 Issue: 1 Volume: 13 Year: 2019 Keywords: continuous review (s, S) inventory system; postponed demands; service facility; waiting time analysis. File-URL: http://www.inderscience.com/link.php?id=97936 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:1:p:1-28 Template-Type: ReDIF-Article 1.0 Author-Name: Hasan Rasay Author-X-Name-First: Hasan Author-X-Name-Last: Rasay Author-Name: Mohammad Saber Fallahnezhad Author-X-Name-First: Mohammad Saber Author-X-Name-Last: Fallahnezhad Author-Name: Yahia Zaremehrjerdi Author-X-Name-First: Yahia Author-X-Name-Last: Zaremehrjerdi Title: An integrated model of statistical process control and maintenance planning for a two-stage dependent process under general deterioration Abstract: Consider a two-stage dependent process in which each stage has a unique quality characteristic. Based on a regression formula, the quality characteristic of the second stage is dependent on that of the first stage. There may be two assignable causes in the process. Each cause can lead to a change in the mean of the process. The process failure mechanism for each stage follows a general continuous distribution function, and two control charts are simultaneously used to monitor the process. Specifically, the first stage is monitored using a Shwehart control chart, and the second stage is monitored using a cause-selecting control chart. An integrated model is developed for maintenance planning (MP) and statistical process control (SPC). To analyse the performance of the integrated model, a stand-alone model for SPC is developed. A comparison of the two models, i.e., the integrated model and the stand-alone model, is conducted. Finally, using a fractional factorial design, a depth analysis is performed about the integrated model. [Received: 10 February 2018; Revised: 21 April 2018; Revised: 4 June 2018; Revised: 12 September 2018; Revised: 7 October 2018; Accepted: 9 October 2018] Journal: European J. of Industrial Engineering Pages: 149-177 Issue: 2 Volume: 13 Year: 2019 Keywords: statistical process control; SPC; maintenance planning; multi-stage dependent process; failure mechanism; integrated model; cause-selecting control chart. File-URL: http://www.inderscience.com/link.php?id=98508 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:2:p:149-177 Template-Type: ReDIF-Article 1.0 Author-Name: Chirakiat Saithong Author-X-Name-First: Chirakiat Author-X-Name-Last: Saithong Author-Name: Huynh Trung Luong Author-X-Name-First: Huynh Trung Author-X-Name-Last: Luong Title: Effect of supply disruption on inventory policy Abstract: This research examines a two-stage supply chain that comprises a supplier who is subject to stochastic disruption and a retailer who has to deal with supply disruption by holding inventory. Under a periodic-review base-stock inventory policy, the main objectives of this study are to determine the optimal inventory policy in the presence of stochastic supply disruption so as to minimise the total inventory cost as well as to analyse the impact of supply disruption on the optimal inventory policy. In this research, the length of a supply disruption is modelled as a continuous random variable, distinguishing it from previous research which modelled the length of a supply disruption as a discrete random variable that receives values only as multiples of the length of a review period. Numerical experiments have been conducted to illustrate the applicability of the proposed inventory model and to examine the effects of various input parameters on the optimal inventory policy. Furthermore, compared with the optimal inventory policy derived when the length of a supply disruption is considered as a multiple of the length of a review period, the proposed inventory model in this research can help derive a more precise optimal inventory policy. [Received: 13 February 2017; Revised: 7 December 2017; Accepted: 17 October 2018] Journal: European J. of Industrial Engineering Pages: 178-212 Issue: 2 Volume: 13 Year: 2019 Keywords: supply disruption; disruption mitigation strategy; base stock inventory policy; renewal reward process. File-URL: http://www.inderscience.com/link.php?id=98511 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:2:p:178-212 Template-Type: ReDIF-Article 1.0 Author-Name: Mehmet A. Begen Author-X-Name-First: Mehmet A. Author-X-Name-Last: Begen Author-Name: Martin L. Puterman Author-X-Name-First: Martin L. Author-X-Name-Last: Puterman Author-Name: Hongtu Wu Author-X-Name-First: Hongtu Author-X-Name-Last: Wu Title: Development of an operational and tactical decision support tool for a Canadian beverage firm: a case study Abstract: This paper describes a logistics optimisation case study for a Canadian beverage manufacturer and distributor. The goal was to determine production, distribution and inventory plans for a given product line to help the company with its challenges due to production shortages, stock-outs and high transportation costs in a new and highly competitive market. We built and implemented an optimisation model in Excel with VBA as a customised planning tool. Although we originally designed the tool for operational planning, the beverage company first used it for tactical planning (in price negotiations with the firm's subcontractors, deciding whether to buy a bankrupt subcontractor production site, and quantification of carrying extra inventory). The tool has changed the way the company conducts its business planning by evaluating 'what if' scenarios, finding an optimal operational plan, and forcing the company to think more strategically and for longer horizons. [Received: 21 January 2017; Revised: 30 March 2018; Revised: 30 September 2018; Accepted: 28 October 2018] Journal: European J. of Industrial Engineering Pages: 245-263 Issue: 2 Volume: 13 Year: 2019 Keywords: operations research practice; decision support systems; optimisation; operational and tactical planning; Excel Solver; visual basic for applications; VBA. File-URL: http://www.inderscience.com/link.php?id=98515 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:2:p:245-263 Template-Type: ReDIF-Article 1.0 Author-Name: Jiseong Noh Author-X-Name-First: Jiseong Author-X-Name-Last: Noh Author-Name: Jong Soo Kim Author-X-Name-First: Jong Soo Author-X-Name-Last: Kim Author-Name: Biswajit Sarkar Author-X-Name-First: Biswajit Author-X-Name-Last: Sarkar Title: Two-echelon supply chain coordination with advertising-driven demand under Stackelberg game policy Abstract: This paper develops a two-echelon supply chain model with a single manufacturer and a single retailer, where the demand is sensitive to advertising and retail price. To resolve the supply chain coordination, three strategies are introduced as retailer leader-manufacturer follower, manufacturer leader-retailer follower, and centralised supply chain. Based on these strategies, this paper suggests an optimal production rate, a production lot size, shortage level, an advertising expenditure, and retail price. Stackelberg approach is employed for solving leader-follower game to obtain the maximum profit of both manufacturer and retailer. The improved algorithm is developed to obtain the numerical results. For testing the model, this paper considers several numerical experiments, graphical illustrations, and sensitivity analysis. The result shows that the strategy of retailer leader-manufacturer follower obtains the highest profit than other strategies. [Received: 23 September 2017; Revised: 28 November 2017; Revised: 29 April 2018; Revised: 19 July 2018; Revised: 21 October 2018; Accepted: 21 October 2018] Journal: European J. of Industrial Engineering Pages: 213-244 Issue: 2 Volume: 13 Year: 2019 Keywords: supply chain management; advertising expenditure; game theory; production/inventory; Stackelberg approach. File-URL: http://www.inderscience.com/link.php?id=98516 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:2:p:213-244 Template-Type: ReDIF-Article 1.0 Author-Name: Ata Allah Taleizadeh Author-X-Name-First: Ata Allah Author-X-Name-Last: Taleizadeh Author-Name: Hamid Reza Zarei Author-X-Name-First: Hamid Reza Author-X-Name-Last: Zarei Author-Name: Bhaba R. Sarker Author-X-Name-First: Bhaba R. Author-X-Name-Last: Sarker Title: An optimal ordering and replenishment policy for a vendor-buyer system under varying replenishment intervals and delayed payment Abstract: The replenishment intervals can be probabilistic when the system or the supplier has problem with manufacturing or shipping the goods. In this paper, an economic order quantity (EOQ) model with probabilistic replenishment intervals and permissible delay in payments with partial backordering is developed. This paper considers three different possible situations and suggests optimal inventory policy for each situation separately regarding the amount of expected order quantity and replenishment-up-to level that maximises the expected cyclic profit for the buyers. The model is analysed for the uniform and exponential probability distribution functions (PDF) for time of replenishment and a closed-form solution is achieved in all cases. Finally, a sensitivity analysis is performed to know the general functional behaviour and to clarify the applicability of the proposed model when the system behaviour is unstable. The results indicate that a customer can obtain the optimum replenishment-up-to level and order quantity when the replenishment intervals is probabilistic in three different possible situations. [Received: 17 August 2017; Revised: 10 January 2018; Revised: 23 August 2018; Accepted: 11 November 2018] Journal: European J. of Industrial Engineering Pages: 264-298 Issue: 2 Volume: 13 Year: 2019 Keywords: varying replenishment intervals; delay in payments; partial backordering; incentive scheme. File-URL: http://www.inderscience.com/link.php?id=98520 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:2:p:264-298 Template-Type: ReDIF-Article 1.0 Author-Name: Atıl Kurt Author-X-Name-First: Atıl Author-X-Name-Last: Kurt Author-Name: Ferda Can Çetinkaya Author-X-Name-First: Ferda Can Author-X-Name-Last: Çetinkaya Author-Name: Meral Azizoğlu Author-X-Name-First: Meral Author-X-Name-Last: Azizoğlu Title: A blood distribution problem with new transportation options - an application for the Turkish Red Crescent Abstract: This paper considers the blood distribution problem in the Central Anatolian Regional Blood Centre of the Turkish Red Crescent (TRC) and proposes several demand satisfaction options considering the irradiation centres, urgent demands, and product availability. Our aim is to maximise the total weighted blood demand satisfaction. To address the problem, we develop a mixed integer linear programming model and propose a hybrid genetic algorithm (HGA). The results of our experiments have revealed that the mathematical model cannot handle even small sized problem instances in reasonable times; however, the hybrid genetic algorithm is capable of handling complex daily operations of the Turkish Red Crescent. [Received: 19 September 2018; Revised: 3 December 2018; Accepted: 3 December 2018] Journal: European J. of Industrial Engineering Pages: 332-367 Issue: 3 Volume: 13 Year: 2019 Keywords: blood distribution system; transportation options; vehicle routing; mixed integer linear programming model; genetic algorithm. File-URL: http://www.inderscience.com/link.php?id=100002 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:3:p:332-367 Template-Type: ReDIF-Article 1.0 Author-Name: Woo-Sung Kim Author-X-Name-First: Woo-Sung Author-X-Name-Last: Kim Author-Name: Dae-Eun Lim Author-X-Name-First: Dae-Eun Author-X-Name-Last: Lim Title: On an automated material handling system design problem in cellular manufacturing systems Abstract: We consider the automated material handling system design problem in a cellular manufacturing system (CMS). Simple transportation units including low-cost automated guided vehicles are quite often used in CMSs in South Korea. It is assumed that a transportation unit circulates among a group of cells (stations), and the unit is assumed to collect items from the output buffer of the stations. Collected items are unloaded at a cell which functions as a storage. We are interested in the capacity of the transportation unit, or the number of cells the transportation should visit. Using an embedded Markov chain, we derive the remaining capacity of the transportation unit when it leaves each station. In addition, the probability that the transportation unit is full at its departure epoch is also derived. We provide various numerical results including the effect of volatility of the arrival rates among stations. [Received: 30 December 2017; Revised: 18 October 2018; Accepted: 16 December 2018] Journal: European J. of Industrial Engineering Pages: 400-419 Issue: 3 Volume: 13 Year: 2019 Keywords: seru production system; cellular manufacturing system; queueing analysis; multi-load AGV; tandem AGV. File-URL: http://www.inderscience.com/link.php?id=100005 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:3:p:400-419 Template-Type: ReDIF-Article 1.0 Author-Name: Mohammad Saffari Author-X-Name-First: Mohammad Author-X-Name-Last: Saffari Author-Name: Mohsen S. Sajadieh Author-X-Name-First: Mohsen S. Author-X-Name-Last: Sajadieh Author-Name: Farhad Hassanzadeh Author-X-Name-First: Farhad Author-X-Name-Last: Hassanzadeh Title: A queuing system with inventory and competing suppliers Abstract: A single-server queuing system is considered where service consumes one unit of inventory which is maintained by two suppliers with different price and replenishment lead times. During inventory stockout, new customers refuse to enter the system (lost sales) but the existing ones remain in queue until inventory becomes available again (backlogged demand). We analytically derive the joint distribution of queue length and on-hand inventory in steady state and determine supplier-specific ordering policies that maximise the average system profit. A special case of the system with multiple servers is addressed. A numerical study reveals dynamics of the optimal ordering policy with respect to price and replenishment lead-times. [Received: 15 April 2018; Revised: 21 November 2018; Accepted: 18 December 2018] Journal: European J. of Industrial Engineering Pages: 420-433 Issue: 3 Volume: 13 Year: 2019 Keywords: inventory; competing suppliers; queuing; stationary distribution. File-URL: http://www.inderscience.com/link.php?id=100006 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:3:p:420-433 Template-Type: ReDIF-Article 1.0 Author-Name: Tanja Parezanović Author-X-Name-First: Tanja Author-X-Name-Last: Parezanović Author-Name: Marijana Petrović Author-X-Name-First: Marijana Author-X-Name-Last: Petrović Author-Name: Nataša Bojković Author-X-Name-First: Nataša Author-X-Name-Last: Bojković Author-Name: Dragan Pamučar Author-X-Name-First: Dragan Author-X-Name-Last: Pamučar Title: One approach to evaluate the influence of engineering characteristics in QFD method Abstract: Evaluation of engineering characteristics (ECs) according to customer requirements (CRs) is the most decisive step of the house of quality in quality function deployment (QFD) method. In most cases, high degrees of correlation between ECs exist and should be modelled. The paper develops a specific measure ('influence gap') and novel underlying procedure (smallest gap technique) for ECs evaluation aiming to capture all interdependencies. The influence gap enables to characterise each EC according to its distance from ideal-maximum influence on all requirements. The relationships between CRs and ECs and their inter-relationships are obtained using interval-valued fuzzy DEMATEL method. From the practical point of view, the most important information for decision maker(s) generated by the model is the clear insight about the contribution of each EC when launching a new product/service. Practicability and usability of the proposed methodology is illustrated over a specific transportation service. [Received: 6 January 2018; Accepted: 2 December 2018] Journal: European J. of Industrial Engineering Pages: 299-331 Issue: 3 Volume: 13 Year: 2019 Keywords: quality function deployment; QFD; DEMATEL; multicriteria decision making; MCDM; interval-valued fuzzy numbers; smallest gap technique; carpooling; customer requirements; engineering characteristics; influence gap. File-URL: http://www.inderscience.com/link.php?id=100013 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:3:p:299-331 Template-Type: ReDIF-Article 1.0 Author-Name: Anindita Kundu Author-X-Name-First: Anindita Author-X-Name-Last: Kundu Author-Name: Partha Guchhait Author-X-Name-First: Partha Author-X-Name-Last: Guchhait Author-Name: Goutam Panigrahi Author-X-Name-First: Goutam Author-X-Name-Last: Panigrahi Author-Name: Manoranjan Maiti Author-X-Name-First: Manoranjan Author-X-Name-Last: Maiti Title: An EOQ model for deteriorating item with promotional effort and credit linked demand Abstract: In the traditional supply chain models, it is observed that usually suppliers offer to the retailers a credit period and also the retailer to the customers to stimulate sales and reduce inventory. This practice of retailers increases the default risk of the percentage of customers not willing to pay back. In this paper, an inventory model has been developed under two levels of trade credit policy with customers' default risk consideration for a deteriorating item having a maximum lifetime. The supplier offers a partially permissible delay in payment per order and the retailer, in turn, provides a part of it to customers. Here, both demand and default risk are functions of the customer's trade credit period, whereas demand is also promotional effort sensitive. To mimic the changing market, the inventory costs are assumed to be imprecise. The models are illustrated numerically and some sensitivity analyses are presented. [Received: 13 January 2017; Revised: 14 September 2017; Revised: 10 June 2018; Accepted: 10 December 2018] Journal: European J. of Industrial Engineering Pages: 368-399 Issue: 3 Volume: 13 Year: 2019 Keywords: EOQ model; two-level partial trade credit period; promotional effort; default risk; time-dependent deterioration; credit-sensitive demand; default risk; fuzzy inventory model; rough inventory model; infinite planning horizon; GRG technique; LINGO software. File-URL: http://www.inderscience.com/link.php?id=100015 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:3:p:368-399 Template-Type: ReDIF-Article 1.0 Author-Name: Ming-Hua Lin Author-X-Name-First: Ming-Hua Author-X-Name-Last: Lin Author-Name: Jung-Fa Tsai Author-X-Name-First: Jung-Fa Author-X-Name-Last: Tsai Author-Name: Pei-Chun Wang Author-X-Name-First: Pei-Chun Author-X-Name-Last: Wang Author-Name: Yu-Ting Ho Author-X-Name-First: Yu-Ting Author-X-Name-Last: Ho Title: A coordinated production planning model with capacity expansion for supply chain networks Abstract: Developing a flexible supply chain is important for enterprises to face market volatility and diversity. In order to satisfy order requirements under demand uncertainty, this study constructs a coordinated production planning model of supply chain networks considering production capacity expansion. Besides, the proposed model involves batch production that is commonly used in many companies. The constructed model is then linearised as a mixed-integer linear programming problem to guarantee global optimality. The solution of the reformulated model determines the optimal production, transportation and inventory levels as well as the optimal batch production operations and capacity expansion strategy. Several numerical experiments are conducted to demonstrate the effectiveness of the proposed method and the impacts of production capacity expansion on the operations of the supply chain. [Received: 27 November 2017; Revised: 13 August 2018; Accepted: 29 December 2018]. Journal: European J. of Industrial Engineering Pages: 435-460 Issue: 4 Volume: 13 Year: 2019 Keywords: supply chain management; coordinated production planning model; demand uncertainty; batch production; flexible production capacity; linear transformation; deterministic optimisation. File-URL: http://www.inderscience.com/link.php?id=100917 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:4:p:435-460 Template-Type: ReDIF-Article 1.0 Author-Name: Neda Rezaei Author-X-Name-First: Neda Author-X-Name-Last: Rezaei Author-Name: Sadoullah Ebrahimnejad Author-X-Name-First: Sadoullah Author-X-Name-Last: Ebrahimnejad Author-Name: Amirhossein Moosavi Author-X-Name-First: Amirhossein Author-X-Name-Last: Moosavi Author-Name: Adel Nikfarjam Author-X-Name-First: Adel Author-X-Name-Last: Nikfarjam Title: A green vehicle routing problem with time windows considering the heterogeneous fleet of vehicles: two metaheuristic algorithms Abstract: In this paper, the green vehicle routing problem with time windows constraint is studied in the presence of a heterogeneous fleet of vehicles and filling stations. In addition, the number of vehicles and their fuel tank capacity are both limited. The main contribution of this study is the simultaneous consideration of these features, which makes the problem more practical. For this purpose, a mixed integer linear programming model that minimises the transportation costs and (or carbon dioxide) emissions, is proposed. Furthermore, a genetic algorithm and a population-based simulated annealing are developed to find high-quality solutions for large-scale instances. To validate the proposed model and algorithms, 28 instances are generated using a benchmark database. The computational results demonstrate that both algorithms provide efficient solutions regarding the objective function value and CPU time. Finally, a comprehensive sensitivity analysis is carried out to show the importance of features mentioned above. [Received: 7 October 2016; Revised: 27 December 2018; Accepted: 13 January 2019] Journal: European J. of Industrial Engineering Pages: 507-535 Issue: 4 Volume: 13 Year: 2019 Keywords: green vehicle routing problem; GVRP; time windows; heterogeneous fleet of vehicles; filling station; genetic algorithm; simulated annealing. File-URL: http://www.inderscience.com/link.php?id=100919 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:4:p:507-535 Template-Type: ReDIF-Article 1.0 Author-Name: Onur Köksoy Author-X-Name-First: Onur Author-X-Name-Last: Köksoy Author-Name: Pelin Ergen Author-X-Name-First: Pelin Author-X-Name-Last: Ergen Author-Name: Melis Zeybek Author-X-Name-First: Melis Author-X-Name-Last: Zeybek Title: A new right-skewed loss function in process risk assessment Abstract: Due to globalisation, competitive companies realise that providing a more reliable, predictable, and robust product/process is a prerequisite for satisfying their customers and running a successful operation. Many quality improvement techniques focus on reducing process variation in line with the 'loss to society' concept. The widespread use of loss functions in industrial applications has increased their popularity with different loss-handling features. Developments relating to the inverted probability density functions (PDFs) have allowed the application of particular loss functions in a wide range. This paper presents the inverted Wald loss function as a new member of the inverted probability loss family. The important features of the proposed right-skewed loss function are discussed, and the risk functions associated with some process distributions of interest are obtained. Moreover, the proposed loss function and its performance are illustrated on the basis of a comparative study and an industrial example, including the monitoring of loss. [Received: 22 May 2018; Revised: 11 August 2018; Revised: 29 October 2018; Revised: 14 January 2019; Accepted: 23 January 2019] Journal: European J. of Industrial Engineering Pages: 536-551 Issue: 4 Volume: 13 Year: 2019 Keywords: asymmetric quality loss functions; inverted Wald loss function; IWLF; risk function; inverted probability loss functions; Wald distribution. File-URL: http://www.inderscience.com/link.php?id=100928 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:4:p:536-551 Template-Type: ReDIF-Article 1.0 Author-Name: Shin-Li Lu Author-X-Name-First: Shin-Li Author-X-Name-Last: Lu Title: Economic-statistical design of EWMA-semicircle charts under the Taguchi loss function Abstract: A single exponentially weighted moving average (EWMA) chart is effectively used to monitor the process mean and/or variance simultaneously. An EWMA-semicircle (EWMA-SC) chart designed from the economic-statistical perspective is proposed, which incorporates Taguchi's quadratic loss function into Lorenzen and Vance's cost model. Moreover, economic-statistical performance and the effect on process capability index are compared to those with sum of square EWMA (SS-EWMA) and maximum EWMA (MaxEWMA) charts. The optimal decision variables - namely, sample size <i>n</i>, sampling interval time <i>h</i>, control limit width<i> L</i> and smoothing constant <i>λ</i> - are obtained by minimising the expected cost function. Via simulations, the EWMA-SC chart is found to incur the smallest expected cost when a process mean and variance simultaneously shift. However, the MaxEWMA chart incurs the lowest cost of defective products when a process means shifts on its own. [Received: 1 May 2017; Revised: 22 August 2018; Accepted: 3 January 2019] Journal: European J. of Industrial Engineering Pages: 489-506 Issue: 4 Volume: 13 Year: 2019 Keywords: EWMA charts; economic-statistical design; cost model; quadratic loss function. File-URL: http://www.inderscience.com/link.php?id=100935 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:4:p:489-506 Template-Type: ReDIF-Article 1.0 Author-Name: Prasenjit Pramanik Author-X-Name-First: Prasenjit Author-X-Name-Last: Pramanik Author-Name: Manas Kumar Maiti Author-X-Name-First: Manas Kumar Author-X-Name-Last: Maiti Title: An inventory model with variable demand incorporating unfaithfulness of customers under two-level trade credit Abstract: In this research work, an inventory model has been developed under two-level trade credit policy with unfaithful customers. A percentage of the total customers are treated as unfaithful customers. Demand is influenced by customers' credit period, credit amount and selling price. Due to the vagueness of some parameters, the proposed model is formulated in both the crisp and fuzzy environments. The main purpose of this research work is to determine the optimal replenishment policy so that the total profit of the retailer is maximised. The existence of a solution to the problem is discussed theoretically and then some numerical experiments are undertaken. To find the marketing decision of a generalised model (when the number of variables increases) and for the fuzzy objectives, a soft computing technique is used. Some sensitivity analyses are performed to provide some managerial insights. Finally a conclusion is drawn and some future research directions are proposed. [Received: 14 November 2017; Accepted: 2 January 2019] Journal: European J. of Industrial Engineering Pages: 461-488 Issue: 4 Volume: 13 Year: 2019 Keywords: inventory; trade credit; unfaithful customers; particle swarm optimisation; variable demand. File-URL: http://www.inderscience.com/link.php?id=100957 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:4:p:461-488 Template-Type: ReDIF-Article 1.0 Author-Name: Sena Kır Author-X-Name-First: Sena Author-X-Name-Last: Kır Author-Name: Harun Resit Yazgan Author-X-Name-First: Harun Resit Author-X-Name-Last: Yazgan Title: A novel hierarchical approach for a heterogeneous 3D pallet loading problem subject to factual loading and delivery constraints Abstract: This paper presents a hierarchical approach, which consists of a two-stage genetic algorithm and a mixed integer linear programming, for a heterogeneous three-dimensional pallet loading problem in consideration of the rotation, the relative positioning, the load-bearing strength and the fragility constraints. Stage #1 of the proposed two-stage genetic algorithm provides to reduce the number of items to be packed by combining similar items based on a stack-building approach. And, stage #2 provides to estimate the number of required free pallets. After that, the proposed mixed integer linear programming solves the problem considering the findings of the proposed two-stage genetic algorithm. The proposed hierarchical approach was tested on well-known instances leading to favourable results and compared with a decent solution approach. In addition, a case study was presented. [Received: 7 July 2018; Revised: 20 November 2018; Accepted: 25 January 2019] Journal: European J. of Industrial Engineering Pages: 627-650 Issue: 5 Volume: 13 Year: 2019 Keywords: logistics; 3D pallet loading problem; MILP; genetic algorithm; intelligent dynamic crossover. File-URL: http://www.inderscience.com/link.php?id=102155 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:5:p:627-650 Template-Type: ReDIF-Article 1.0 Author-Name: H.M. Soroush Author-X-Name-First: H.M. Author-X-Name-Last: Soroush Author-Name: Fatmah Almathkour Author-X-Name-First: Fatmah Author-X-Name-Last: Almathkour Title: A dominance-based heuristic to minimise completion time variance in a single machine system Abstract: This paper addresses the problem of minimising the variance of job completion times in a deterministic single-machine scheduling system. Minimising completion time variance is an appropriate objective in scheduling environments where service uniformity is essential. Due to the NP-hard nature of the problem, various heuristics have been presented to obtain a near-optimal solution. In this paper, we introduce a new heuristic based on some powerful precedence (dominance) relation structures, including the concepts of permanent and temporary precedence (dominance) relationships, to determine the positions of adjacent and non-adjacent jobs in a sequence. Our computational experiments demonstrate that the proposed heuristic significantly outperforms the existing ones in deriving the optimal or near-optimal solutions for three well-known sets of benchmark problems and some large randomly generated instances. [Received: 5 August 2018; Revised: 24 December 2018; Accepted: 23 January 2019] Journal: European J. of Industrial Engineering Pages: 589-626 Issue: 5 Volume: 13 Year: 2019 Keywords: scheduling; single machine; completion time variance; heuristic; precedence; dominance. File-URL: http://www.inderscience.com/link.php?id=102157 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:5:p:589-626 Template-Type: ReDIF-Article 1.0 Author-Name: Jae-Dong Hong Author-X-Name-First: Jae-Dong Author-X-Name-Last: Hong Author-Name: Ki-Young Jeong Author-X-Name-First: Ki-Young Author-X-Name-Last: Jeong Title: Humanitarian supply chain network design using data envelopment analysis and multi-objective programming models Abstract: Emergency events such as natural disasters or terrorist attacks seem to occur anywhere and tend to increase. This paper studies a humanitarian supply chain network (<i>HTSCN</i>) design problem in a pre-disaster scenario, which consists of finding the optimal emergency response facility (<i>ERF</i>) locations and allocation scheme of humanitarian supplies through <i>ERF</i>s, where all <i>ERF</i>s are under the risk of disruptions. Naturally, this type of design problem should deal with multiple goals. An innovative two-step framework of designing efficient <i>HTSCN</i> by combining multi-objective programming (MOP) models with data envelopment analysis (DEA) is proposed. A case study using the historical data on the disasters in South Carolina, USA is presented to illustrate the effectiveness and efficiency of the proposed combining framework. The case study demonstrates that the proposed procedure would help practitioners and researchers generate a finer evaluation of efficiency and would provide a benchmarking methodology for designing <i>HTSCN</i> system. [Received: 22 October 2017; Revised: 9 April 2018; Revised: 15 October 2018; Revised: 22 December 2018; Accepted: 26 January 2019] Journal: European J. of Industrial Engineering Pages: 651-680 Issue: 5 Volume: 13 Year: 2019 Keywords: humanitarian supply chain network; HTSCN; emergency response facility; ERF; data envelopment analysis; DEA; multi-objective programming approach. File-URL: http://www.inderscience.com/link.php?id=102158 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:5:p:651-680 Template-Type: ReDIF-Article 1.0 Author-Name: Adel Kacem Author-X-Name-First: Adel Author-X-Name-Last: Kacem Author-Name: Abdelaziz Dammak Author-X-Name-First: Abdelaziz Author-X-Name-Last: Dammak Title: Bi-objective scheduling on two dedicated processors Abstract: In this work, we study a bi-objective scheduling problem on two dedicated processors. The aim is to minimise the makespan and the total tardiness. This NPhard problem in the strong sense requires the use of well-adapted methods. Our contribution includes lower bounds for each studied criterion and a genetic algorithm adapted for the multi-criteria context. The lower bounds allows us to evaluate the quality of feasible solutions and the genetic algorithm incorporates the optimisation part. We implemented our approach by considering the aggregative, NSGA-II and the Pareto scenarios on a large set of instances. The obtained results show the effectiveness of the proposed algorithms. [Received: 27 August 2018; Revised: 25 January 2019; Accepted: 12 March 2019] Journal: European J. of Industrial Engineering Pages: 681-700 Issue: 5 Volume: 13 Year: 2019 Keywords: scheduling; total of tardiness; tasks; makespan; dedicated processors; genetic algorithms; lower bound; bi-objective; Pareto front; NSGA-II. File-URL: http://www.inderscience.com/link.php?id=102165 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:5:p:681-700 Template-Type: ReDIF-Article 1.0 Author-Name: Mohammad Reza Ghatreh Samani Author-X-Name-First: Mohammad Reza Ghatreh Author-X-Name-Last: Samani Author-Name: Seyyed-Mahdi Hosseini-Motlagh Author-X-Name-First: Seyyed-Mahdi Author-X-Name-Last: Hosseini-Motlagh Author-Name: Maryam Izadidoost Sheshkol Author-X-Name-First: Maryam Izadidoost Author-X-Name-Last: Sheshkol Author-Name: Seyyed-Nader Shetab-Boushehri Author-X-Name-First: Seyyed-Nader Author-X-Name-Last: Shetab-Boushehri Title: A bi-objective integrated model for the uncertain blood network design with raising products quality Abstract: Blood transfusion is a multi-step process with risks in each process from selecting donors to transfusing the patient. Meanwhile, the quality plays an essential part throughout the blood supply chain. In this regard, this study proposes a bi-objective model for an integrated blood supply chain network design. The first objective function tries to minimise the total network cost, whereas the second objective seeks to maximise the quality factor. Due to the epistemic uncertainty of critical parameters, a fuzzy method, as well as some robust approaches, are tailored. The applicability and performance of these proposed methods and their validation are studied in a real case of Tehran's blood network. The results illustrate the preference of realistic robust approach to the other methods due to reduction in cost as well as preserving the quality. Finally, the paper comes to an end with the sensitivity analysis, conclusion and some suggestions for future directions. [Received: 22 June 2018; Accepted: 9 January 2019] Journal: European J. of Industrial Engineering Pages: 553-588 Issue: 5 Volume: 13 Year: 2019 Keywords: blood supply chain; healthcare management; multi-objective optimisation; robust programming; raising quality. File-URL: http://www.inderscience.com/link.php?id=102182 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:eujine:v:13:y:2019:i:5:p:553-588