Template-Type: ReDIF-Article 1.0
Author-Name: Jae-Min Yu
Author-X-Name-First: Jae-Min
Author-X-Name-Last: Yu
Author-Name: Dong-Ho Lee
Author-X-Name-First: Dong-Ho
Author-X-Name-Last: Lee
Title: Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
Abstract:
This study addresses a job shop scheduling problem in which jobs are grouped into job families, but they are processed individually using their distinct routings. Unlike the previous studies, we consider a due-date-based objective of minimising the total family tardiness, i.e., sum of positive deviations between the due-dates and the completion times of job families. A mixed integer programming model is developed to represent the problem mathematically. Then, an optimal algorithm is proposed using the branch and bound technique while developing a job family-based lower bound. For practical applications up to large sized instances, two types of heuristics, modified shifting bottleneck and priority scheduling algorithms, are also proposed. To test the performances of the three types of solution algorithms, computational experiments were done on a number of test instances and the results are reported. [Received: 10 September 2016; Revised: 28 February 2017; Revised: 6 June 2017; Accepted: 22 August 2017]
Journal: European J. of Industrial Engineering
Pages: 1-23
Issue: 1
Volume: 12
Year: 2018
Keywords: job shop scheduling; job families; family tardiness; branch and bound; heuristics.
File-URL: http://www.inderscience.com/link.php?id=89876
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:1:p:1-23

Template-Type: ReDIF-Article 1.0
Author-Name: Nadjat Meziani
Author-X-Name-First: Nadjat
Author-X-Name-Last: Meziani
Author-Name: Mourad Boudhar
Author-X-Name-First: Mourad
Author-X-Name-Last: Boudhar
Author-Name: Ammar Oulamara
Author-X-Name-First: Ammar
Author-X-Name-Last: Oulamara
Title: PSO and simulated annealing for the two-machine flowshop scheduling problem with coupled-operations
Abstract:
In this paper, we proposed an hybrid algorithm combining particle swarm optimisation with the simulated annealing (PSO-SA) to solve the flowshop problem with coupled-operations in the presence of the time lags. The criterion to minimise is the makespan. To verify the performance of the hybridised algorithm, computational experiments are performed and the obtained results are compared with the simulated annealing and PSO algorithms. However, the experimental results show that the PSO-SA performs better than the others approaches. [Received: 6 May 2017; Revised: 20 July 2017; Revised: 17 September 2017; Accepted: 16 September 2017]
Journal: European J. of Industrial Engineering
Pages: 43-66
Issue: 1
Volume: 12
Year: 2018
Keywords: flowshop; coupled-operations; makespan; PSO; simulated annealing.
File-URL: http://www.inderscience.com/link.php?id=89877
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:1:p:43-66

Template-Type: ReDIF-Article 1.0
Author-Name: Yang-Byung Park
Author-X-Name-First: Yang-Byung
Author-X-Name-Last: Park
Author-Name: Sung-Joon Yoon
Author-X-Name-First: Sung-Joon
Author-X-Name-Last: Yoon
Author-Name: Jun-Su Yoo
Author-X-Name-First: Jun-Su
Author-X-Name-Last: Yoo
Title: Development of a knowledge-based intelligent decision support system for operational risk management of global supply chains
Abstract:
This paper proposes a knowledge-based intelligent decision support system for operational risk management of global supply chains (DSSRMG), a full-phase system not yet treated in the literature. DSSRMG predicts the supply chain performance using the enhanced artificial neural network combined with particle swarm optimisation, infers the core risk source using a method based on principle component analysis, and evaluates risk mitigation alternatives using the digraph-matrix approach combined with principle component analysis. A methodology using an adaptive-network-based fuzzy inference system is suggested to construct the knowledge base for mitigation alternatives. An industrial example is used to illustrate the performance of DSSRMG. Computational experiments show that the techniques used for DSSRMG are excellent. Especially, the algorithm for selecting the useful operation indicators improves the performance prediction accuracy by 7.1% on average. DSSRMG provides supply chain managers with a practical tool to accurately predict and effectively control the operational risk. [Received: 9 March 2017; Revised: 22 July 2017; Accepted: 2 October 2017]
Journal: European J. of Industrial Engineering
Pages: 93-115
Issue: 1
Volume: 12
Year: 2018
Keywords: supply chain operational risk management; knowledge-based decision support system; particle swarm optimisation; PSO; principle component analysis.
File-URL: http://www.inderscience.com/link.php?id=89878
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:1:p:93-115

Template-Type: ReDIF-Article 1.0
Author-Name: Seyed Hessameddin Zegordi
Author-X-Name-First: Seyed Hessameddin
Author-X-Name-Last: Zegordi
Author-Name: Mohammad Yavari
Author-X-Name-First: Mohammad
Author-X-Name-Last: Yavari
Title: A branch and bound algorithm for solving large-scale single-machine scheduling problems with non-identical release dates
Abstract:
In this paper, we have examined minimising the total completion times in a single-machine scheduling problem with non-identical job release dates. This problem is known to be strongly NP-hard. We have proposed an effective lower bound-based. Also, a near optimal heuristic has been presented that has an average gap of less than 0.077% from the optimum solution. Additionally, in 18% of the problem instances with up to 60 jobs, the upper bound value is equal to the lower bound value. Then we provide two dominance properties. Subsequently, the proposed lower bound, upper bound and dominance properties have been applied in the branch and bound method and have been tested in a wide range of instances. Computational experiments demonstrate the ability of the proposed method to solve hard and large-size problems with up to 130 jobs within a reasonable time. [Received 19 June 2015; Revised 26 November 2016; Revised 24 January 2017; Accepted 5 September 2017]
Journal: European J. of Industrial Engineering
Pages: 24-42
Issue: 1
Volume: 12
Year: 2018
Keywords: single-machine scheduling; release date; lower bound; heuristic; branch and bound method.
File-URL: http://www.inderscience.com/link.php?id=89879
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:1:p:24-42

Template-Type: ReDIF-Article 1.0
Author-Name: Bugra Alkan
Author-X-Name-First: Bugra
Author-X-Name-Last: Alkan
Author-Name: Daniel A. Vera
Author-X-Name-First: Daniel A.
Author-X-Name-Last: Vera
Author-Name: Mussawar Ahmad
Author-X-Name-First: Mussawar
Author-X-Name-Last: Ahmad
Author-Name: Bilal Ahmad
Author-X-Name-First: Bilal
Author-X-Name-Last: Ahmad
Author-Name: Robert Harrison
Author-X-Name-First: Robert
Author-X-Name-Last: Harrison
Title: Complexity in manufacturing systems and its measures: a literature review
Abstract:
Complexity in manufacturing systems still remains a challenge and leads to operational issues and increased production cost. In this paper, drivers of complexity and typical symptoms of complex manufacturing systems are identified. A comprehensive review of studies published within the last two decades to assess manufacturing system complexity are presented. The key contributions of this review are: 1) a classification of complexity assessment methods based on perceived complexity symptoms; 2) a comprehensive review of assessment methods with cross-evaluation to identify appropriate use based on available data; 3) recommendations for the wider academic and industrial community, based on research trends identified in the literature, as to how complexity assessment should be addressed in the future. It is concluded that the assessment of complexity is necessary so that it can be controlled effectively, however the industry suffers from a lack of practical tools to support in this endeavour. [Received 23 December 2016; Revised 18 August, 14 October 2017; Accepted 22 October, 2017]
Journal: European J. of Industrial Engineering
Pages: 116-150
Issue: 1
Volume: 12
Year: 2018
Keywords: complexity; manufacturing systems; complexity metrics; literature review.
File-URL: http://www.inderscience.com/link.php?id=89883
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:1:p:116-150

Template-Type: ReDIF-Article 1.0
Author-Name: Ilkyeong Moon
Author-X-Name-First: Ilkyeong
Author-X-Name-Last: Moon
Author-Name: S.P. Sarmah
Author-X-Name-First: S.P.
Author-X-Name-Last: Sarmah
Author-Name: S. Saha
Author-X-Name-First: S.
Author-X-Name-Last: Saha
Title: The impact of online sales on centralised and decentralised dual-channel supply chains
Abstract:
This paper studies a supply chain structure featuring two different types of distribution channels through which manufacturers sell products. The <i>centralised</i> and <i>decentralised</i> distribution channels considered in this study are affected by online sales outside the structured channels. In the centralised distribution channel, two retail stores located in geographically distinct markets are operated by a single owner. In the decentralised distribution channel, two retailers independently operate two retail stores. In the non-cooperative scenario, the manufacturer always prefers the decentralised distribution channel irrespective of whether an online channel is used. To achieve channel coordination, a revenue-sharing contract is applied, but it can be used to coordinate only the decentralised distribution system. Therefore, a modified revenue-sharing contract is proposed to coordinate the centralised distribution system. The analytical study reveals that without coordination among the channel members, the manufacturer always earns maximum profit in decentralised distribution systems. However, if the supply chain is coordinated, then the manufacturer receives more benefits from using the centralised distribution systems under certain conditions. Propositions are presented to describe the characteristics of distribution structures, and to provide meaningful management guidelines for coordinating them. Extensive numerical investigations are also presented. [Received 20 January 2016; Revised 13 December 2016, 9 March, 4 August 2017; Accepted 25 September 2017]
Journal: European J. of Industrial Engineering
Pages: 67-92
Issue: 1
Volume: 12
Year: 2018
Keywords: supply chain management; dual-channel supply chain; revenue sharing contract; pricing strategy; stackelberg game.
File-URL: http://www.inderscience.com/link.php?id=89887
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:1:p:67-92

Template-Type: ReDIF-Article 1.0
Author-Name: Michael J. Brusco
Author-X-Name-First: Michael J.
Author-X-Name-Last: Brusco
Author-Name: Tony R. Johns
Author-X-Name-First: Tony R.
Author-X-Name-Last: Johns
Author-Name: Ray R. Venkataraman
Author-X-Name-First: Ray R.
Author-X-Name-Last: Venkataraman
Title: LP-based working subsets for personnel scheduling: evaluation and augmentation
Abstract:
This paper evaluates the efficacy of LP-based working subsets for generalised set-covering formulations of personnel scheduling problems and presents a nearest-neighbour augmentation procedure for improving performance. Three experimental studies were completed in the evaluation process. In the first study, the LP-based working subset was sufficient to yield an optimal shift scheduling solution for 85% of the 24,300 test problems and the nearest-neighbour augmentation improved the percentage of optimal solutions to over 98%. The second study focused on more complex cyclic shift scheduling environments that permitted shift length, meal break and relief break flexibility. The adequacy of LP-based working subsets was supported by the provision of optimal shift scheduling solutions for 185 of 189 (98%) of the test problems. The third study examined a challenging tour scheduling environment for which globally-optimal benchmarks are not available. The superiority of the augmented LP-based working subset procedure was nevertheless evident, as it yielded better results than the (non-augmented) LP-based working subset for 92% of the test problems despite being constrained to only 40% of the allowed computation time for the non-augmented subsets. [Received 24 April 2017; Revised 25 August 2017; Revised 17 September 2017; Accepted 6 December 2017]
Journal: European J. of Industrial Engineering
Pages: 175-198
Issue: 2
Volume: 12
Year: 2018
Keywords: personnel scheduling; integer programming; linear programming.
File-URL: http://www.inderscience.com/link.php?id=90614
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:2:p:175-198

Template-Type: ReDIF-Article 1.0
Author-Name: Kamolwon Cha-ume
Author-X-Name-First: Kamolwon
Author-X-Name-Last: Cha-ume
Author-Name: Navee Chiadamrong
Author-X-Name-First: Navee
Author-X-Name-Last: Chiadamrong
Title: Meta-prediction model for introducing lateral transshipment policies in a retail supply chain network through regression analysis
Abstract:
This study finds a way to alleviate and predict the effects of uncertainty in a retail supply chain network through lateral transshipment policies. The study develops a simulation-based optimisation model using the ARENA and OptQuest optimisation tool, and proposes an improved application of the lateral transshipment policy, in addition to four existing policies, to solve such uncertainty. A series of experiments is performed, varying significant cost parameters to study their effects on the profit of the whole chain. In order to determine the best transshipment policy and predict its financial performance, a proposed meta-prediction model based on regression analysis is used to assist in making decisions on the implementation of different types of transshipment policies under various cost scenarios. The proposed methodology assists in decision making on the selection and management of a lateral transshipment policy for a retail supply chain network in a certain situation under an uncertain environment. [Received 20 March 2016; Revised 8 September 2016; Revised 7 December 2017; Accepted 13 December 2017]
Journal: European J. of Industrial Engineering
Pages: 199-232
Issue: 2
Volume: 12
Year: 2018
Keywords: retail supply chain network; lateral transshipment; shortage; simulation; optimisation; break-even point; regression analysis; decision making; meta-prediction model.
File-URL: http://www.inderscience.com/link.php?id=90615
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:2:p:199-232

Template-Type: ReDIF-Article 1.0
Author-Name: Farhad Zahedi-Hosseini
Author-X-Name-First: Farhad
Author-X-Name-Last: Zahedi-Hosseini
Author-Name: Aris A. Syntetos
Author-X-Name-First: Aris A.
Author-X-Name-Last: Syntetos
Author-Name: Philip A. Scarf
Author-X-Name-First: Philip A.
Author-X-Name-Last: Scarf
Title: Optimisation of inspection policy for multi-line production systems
Abstract:
This paper develops a simulation model to determine the cost-optimum inspection policy for a multi-line production system taking account of simultaneous downtime. The machines in the multi-line system are subject to a two stage failure process that is modelled using the delay-time concept. Our study indicates that: consecutive inspection of lines with priority for failure repair is cost-optimal, with a cost reduction of 61% compared to a 'run-to-failure' policy; and maintainers need to be responsive to operational requirements. Our ideas are developed in the context of a case study of a plant with three parallel lines, one of which is on cold-standby. [Received 13 October 2016; Revised 29 April 2017; Revised 14 December 2017; Accepted 14 December 2017]
Journal: European J. of Industrial Engineering
Pages: 233-251
Issue: 2
Volume: 12
Year: 2018
Keywords: maintenance; delay-time model; simulation; production; parallel lines; manufacturing; preventive maintenance.
File-URL: http://www.inderscience.com/link.php?id=90616
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:2:p:233-251

Template-Type: ReDIF-Article 1.0
Author-Name: Maurizio Galetto
Author-X-Name-First: Maurizio
Author-X-Name-Last: Galetto
Author-Name: Fiorenzo Franceschini
Author-X-Name-First: Fiorenzo
Author-X-Name-Last: Franceschini
Author-Name: Domenico A. Maisano
Author-X-Name-First: Domenico A.
Author-X-Name-Last: Maisano
Author-Name: Luca Mastrogiacomo
Author-X-Name-First: Luca
Author-X-Name-Last: Mastrogiacomo
Title: Engineering characteristics prioritisation in QFD using ordinal scales: a robustness analysis
Abstract:
Quality function deployment (QFD) is a management tool used for the design of new products/services and the related production/supply processes. One of the goals of the method is to translate the customer requirements (CRs) into measurable engineering characteristics (ECs) of the new product/service and prioritise them, basing on their relationships with CRs and the related importances. To this purpose, the current scientific literature encompasses several alternative approaches (the most used is the independent scoring method - ISM), in most of which cardinal properties are arbitrarily attributed to data collected on ordinal scales. This paper describes and discusses a new approach based on ME-MCDM (multi expert/multiple criteria decision making) techniques, which do not require any debatable ordinal to cardinal conversion. The theoretical principles and the robustness of the method are presented and tested through some application examples related to a well-known case study reported in the scientific literature. [Received 5 May 2015; Revised 7 November 2017; Accepted 9 November 2017]
Journal: European J. of Industrial Engineering
Pages: 151-174
Issue: 2
Volume: 12
Year: 2018
Keywords: quality function deployment; QFD; ordinal scale; independent scoring method; ISM; MCDM operators.
File-URL: http://www.inderscience.com/link.php?id=90617
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:2:p:151-174

Template-Type: ReDIF-Article 1.0
Author-Name: Lenin Nagarajan
Author-X-Name-First: Lenin
Author-X-Name-Last: Nagarajan
Author-Name: Siva Kumar Mahalingam
Author-X-Name-First: Siva Kumar
Author-X-Name-Last: Mahalingam
Author-Name: Selvakumar Gurusamy
Author-X-Name-First: Selvakumar
Author-X-Name-Last: Gurusamy
Author-Name: Vignesh Kumar Dharmaraj
Author-X-Name-First: Vignesh Kumar
Author-X-Name-Last: Dharmaraj
Title: Solution for bi-objective single row facility layout problem using artificial bee colony algorithm
Abstract:
The single row facility layout problem (SRFLP) is concerned with the arrangements of machineries in a single line for processing multiple products. This arrangement is termed as linear machine sequence (<i>lms</i>). The aim of the proposed work is to design a best <i>lms</i> that simultaneously minimises the objectives: the total flow distance of the products (<i>D</i>); and the total length of the flow line (<i>L</i>) needed for accommodating the machineries in the shop floor. Consideration of more than one objective in a multi-product environment in bi-objective single row facility layout problem (BOSRFLP) is an NP-hard problem. Hence, artificial bee colony (ABC) algorithm is applied to identify the best <i>lms</i>. The effectiveness of the proposed algorithm is verified by solving the problems discussed in the literature. Maximum of 37.54% reduction in total flow distance and 9.31% reduction in total length of the flow line are achieved by the proposed method. [Revise 21 September 2017; Received 27 November 2016; Accepted on 29 December 2017]
Journal: European J. of Industrial Engineering
Pages: 252-275
Issue: 2
Volume: 12
Year: 2018
Keywords: single row facility layout problem; SRFLP; bi-objective; linear machine sequence; lms; artificial bee colony; ABC algorithm; total flow distance; total length of the flow line.
File-URL: http://www.inderscience.com/link.php?id=90619
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:2:p:252-275

Template-Type: ReDIF-Article 1.0
Author-Name: Changchun Liu
Author-X-Name-First: Changchun
Author-X-Name-Last: Liu
Author-Name: Qiang Wang
Author-X-Name-First: Qiang
Author-X-Name-Last: Wang
Author-Name: Xi Xiang
Author-X-Name-First: Xi
Author-X-Name-Last: Xiang
Author-Name: Li Zheng
Author-X-Name-First: Li
Author-X-Name-Last: Zheng
Title: Minimising tardiness in hybrid two-stage batch scheduling problem in cyber-physical systems
Abstract:
The real time characteristic is a critical property of cyber-physical systems and the transmission tardiness introduced by the computer system can lead to a significant performance degradation. In order to improve the real-time performance, data aggregation is always employed during data transmission. This paper studies a hybrid two-stage batch scheduling problem in which a set of receiving sensors are assigned to collect the data at the first stage and an aggregation sensor is employed to receive the data from receiving sensors, fuse and transmit the data to the destination at the second stage. Two objectives, which are minimising the number of tardy tasks and the total transmission tardiness, are studied. Some analytical properties are proved and some algorithms are proposed to solve the problem. Extensive numerical experiments are conducted to test the performances of the proposed algorithms. [Received 27 July 2017; Revised 28 November 2017; Accepted 2 January 2018]
Journal: European J. of Industrial Engineering
Pages: 276-306
Issue: 2
Volume: 12
Year: 2018
Keywords: cyber-physical systems; CPSs; tardiness; dynamic programming; variable neighbourhood search algorithm.
File-URL: http://www.inderscience.com/link.php?id=90622
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:2:p:276-306

Template-Type: ReDIF-Article 1.0
Author-Name: Nadia Bahria
Author-X-Name-First: Nadia
Author-X-Name-Last: Bahria
Author-Name: Anis Chelbi
Author-X-Name-First: Anis
Author-X-Name-Last: Chelbi
Author-Name: Imen Harbaoui Dridi
Author-X-Name-First: Imen Harbaoui
Author-X-Name-Last: Dridi
Author-Name: Hanen Bouchriha
Author-X-Name-First: Hanen
Author-X-Name-Last: Bouchriha
Title: Maintenance and quality control integrated strategy for manufacturing systems
Abstract:
This paper addresses the problem of integration of maintenance and quality control in manufacturing systems which are subject to a degradation process that directly affects the quality of the produced items. Process and product quality control is carried out using an 'x-bar' control chart. According to the average of the measurements of the quality indicator x compared to monitoring and control limits, it is decided to undertake or not a maintenance action that can be either preventive or corrective. A mathematical model is developed to determine the optimal values of the decision variables that are: the sample size, the sampling interval, the number of samples, as well as the monitoring and the control limits of the control chart. The objective is to minimise the average total cost per time unit integrating maintenance and quality costs. A numerical example and a sensitivity analysis are presented to illustrate the proposed approach. [Received: 5 May 2017; Revised: 26 October 2017; Accepted: 23 December 2017]
Journal: European J. of Industrial Engineering
Pages: 307-331
Issue: 3
Volume: 12
Year: 2018
Keywords: maintenance-quality integration; control chart; optimisation; statistical process control; preventive maintenance; corrective maintenance.
File-URL: http://www.inderscience.com/link.php?id=92006
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:3:p:307-331

Template-Type: ReDIF-Article 1.0
Author-Name: Ata Allah Taleizadeh
Author-X-Name-First: Ata Allah
Author-X-Name-Last: Taleizadeh
Author-Name: Shima Rezvan-Beydokhti
Author-X-Name-First: Shima
Author-X-Name-Last: Rezvan-Beydokhti
Author-Name: Leopoldo Eduardo Cárdenas-Barrón
Author-X-Name-First: Leopoldo Eduardo
Author-X-Name-Last: Cárdenas-Barrón
Title: Joint determination of the optimal selling price, refund policy and quality level for complementary products in online purchasing
Abstract:
Recently, companies have an increasing interest in online purchasing or e-shopping. However, in this type of buying the customer cannot validate the quality of the products. Thus, they trust in the return policy as a signal of a good quality. If the customers are not satisfied then they can return the products and refund their money back. This research deals with the problem of joint determination of the optimal selling price, refund policy and quality level for complementary products in an online purchasing. It is assumed that the demand of each product is a function of price, refund and quality level. Furthermore, return policy is also a function of refund and quality level; and return quantity of the products is affected by the return quantity of the other product. The profit maximisation model is illustrated with a numerical example. [Received: 12 February 2015; Revised: 25 August 2017; Accepted: 31 January 2018]
Journal: European J. of Industrial Engineering
Pages: 332-363
Issue: 3
Volume: 12
Year: 2018
Keywords: online purchasing; pricing; return policy; complementary products; refund; quality.
File-URL: http://www.inderscience.com/link.php?id=92007
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:3:p:332-363

Template-Type: ReDIF-Article 1.0
Author-Name: Atıl Kurt
Author-X-Name-First: Atıl
Author-X-Name-Last: Kurt
Author-Name: Meral Azizoglu
Author-X-Name-First: Meral
Author-X-Name-Last: Azizoglu
Author-Name: Ferda Can Çetinkaya
Author-X-Name-First: Ferda Can
Author-X-Name-Last: Çetinkaya
Title: Solution approaches to the blood distribution problem of the Turkish Red Crescent
Abstract:
This paper considers the blood distribution problem that includes irradiation centres, urgent demands, and product availability in Turkey, Central Anatolian Regional Blood Center of the Turkish Red Crescent. To address the problem, we develop a mixed integer linear program with two objectives: maximising the demand satisfaction and minimising total time travelled by the vehicles. We propose two decomposition-based heuristic solution approaches. The results of our experiments have revealed that the model cannot solve even small sized instances in reasonable times; however, the heuristic solution approaches are appropriate for solving complex real life problems. [Received: 5 May 2017; Revised: 21 December 2017; Accepted: 9 February 2018]
Journal: European J. of Industrial Engineering
Pages: 405-441
Issue: 3
Volume: 12
Year: 2018
Keywords: blood distribution system; humanitarian logistics; vehicle routing; mixed integer linear programming model; heuristic solution approaches.
File-URL: http://www.inderscience.com/link.php?id=92008
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:3:p:405-441

Template-Type: ReDIF-Article 1.0
Author-Name: Michael Arias
Author-X-Name-First: Michael
Author-X-Name-Last: Arias
Author-Name: Jorge Munoz-Gama
Author-X-Name-First: Jorge
Author-X-Name-Last: Munoz-Gama
Author-Name: Marcos Sepúlveda
Author-X-Name-First: Marcos
Author-X-Name-Last: Sepúlveda
Author-Name: Juan Carlos Miranda
Author-X-Name-First: Juan Carlos
Author-X-Name-Last: Miranda
Title: Human resource allocation or recommendation based on multi-factor criteria in on-demand and batch scenarios
Abstract:
Dynamic resource allocation is considered a major challenge in the context of business process management. At the operational level, flexible methods that support resource allocation and which consider different criteria at run-time are required. It is also important that these methods are able to support multiple allocations in a simultaneous manner. In this paper, we present a framework based on multi-factor criteria that proposes a recommender system which is capable of recommending the most suitable resources for executing a range of different activities, while also considering individual requests or requests made in blocks. To evaluate the proposed framework, a number of experiments were conducted using different test scenarios. These scenarios provide evidence that our approach based on multi-factor criteria successfully allocates the most suitable resources for executing a process in real and flexible environments. In order to demonstrate this assertion, we use a help-desk process as a real case study. [Received: 19 May 2017; Revised: 23 October 2017; Accepted: 31 January 2018]
Journal: European J. of Industrial Engineering
Pages: 364-404
Issue: 3
Volume: 12
Year: 2018
Keywords: human resource allocation; human resource recommendation; multi-factor criteria; on-demand; batch; dynamic resource allocation; recommender system; business process management; BPM; process mining.
File-URL: http://www.inderscience.com/link.php?id=92009
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:3:p:364-404

Template-Type: ReDIF-Article 1.0
Author-Name: Maria Auxiliadora Cannarozzo Tinoco
Author-X-Name-First: Maria Auxiliadora Cannarozzo
Author-X-Name-Last: Tinoco
Author-Name: Camila Costa Dutra
Author-X-Name-First: Camila Costa
Author-X-Name-Last: Dutra
Author-Name: José Luis Duarte Ribeiro
Author-X-Name-First: José Luis Duarte
Author-X-Name-Last: Ribeiro
Author-Name: Rogério Feroldi Miorando
Author-X-Name-First: Rogério Feroldi
Author-X-Name-Last: Miorando
Author-Name: Carla Schwengber Ten Caten
Author-X-Name-First: Carla Schwengber Ten
Author-X-Name-Last: Caten
Title: An integrated model for evaluation and optimisation of business project portfolios
Abstract:
This paper presents an integrated model for the evaluation and probabilistic optimisation of project portfolios, integrating economic, social and environmental impacts analysis. The contribution of the proposed model lies in: 1) an extended list of criteria covering economic, social and environmental aspects; 2) use of financial measures, which are easily understood; 3) use of Monte Carlo simulation to cope with variability; 4) use of mathematical optimisation to deal with constraints and/or large amount of information. A practical test carried out in a company is reported and confirms the applicability and usefulness of the model. The integration of approaches for sustainable assessment of business projects and selection and optimisation of project portfolio is deficient in literature. Thereby, the proposed model is presented as an alternative to conduct integrated analysis and define optimal project portfolio for sustainable development in business contexts characterised by uncertainties. [Received: 26 October 2015; Revised: 26 August 2017; Revised: 1 March 2018; Accepted: 1 March 2018]
Journal: European J. of Industrial Engineering
Pages: 442-463
Issue: 3
Volume: 12
Year: 2018
Keywords: project portfolio selection; economic analysis; social and environmental impact analysis; probabilistic optimisation.
File-URL: http://www.inderscience.com/link.php?id=92010
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:3:p:442-463

Template-Type: ReDIF-Article 1.0
Author-Name: Dongmin Shin
Author-X-Name-First: Dongmin
Author-X-Name-Last: Shin
Author-Name: Mandeep Mittal
Author-X-Name-First: Mandeep
Author-X-Name-Last: Mittal
Author-Name: Biswajit Sarkar
Author-X-Name-First: Biswajit
Author-X-Name-Last: Sarkar
Title: Effects of human errors and trade-credit financing in two-echelon supply chain models
Abstract:
This paper develops two centralised two-echelon supply chain models with the trade-credit financing and inspection errors. Both models follow a single-setup-multi-delivery (SSMD) policy and each delivery is designed using the just-in-time (JIT) method to increase the efficiency of the supply chain. In first model, the random defective rate is assumed and each delivered item goes through inspection process at the buyer's end due to the contract with vendor, because vendor gives a trade-credit support to buyer. In second model, human errors of Type I and Type II are considered due to tiredness and ignorance of the inspector during inspection process. The joint annual cost of supply chain is minimised with respect to order quantity and number of shipments. Finally, some numerical examples, sensitivity analysis, and graphical representations are given to illustrate more savings from existing literature. [Received 13 December 2015; Revised 19 June 2016; Accepted 28 June 2016]
Journal: European J. of Industrial Engineering
Pages: 465-503
Issue: 4
Volume: 12
Year: 2018
Keywords: supply chain management; imperfect items; human errors; trade-credit financing.
File-URL: http://www.inderscience.com/link.php?id=93574
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:4:p:465-503

Template-Type: ReDIF-Article 1.0
Author-Name: Venkata Prasad Palakiti
Author-X-Name-First: Venkata Prasad
Author-X-Name-Last: Palakiti
Author-Name: Usha Mohan
Author-X-Name-First: Usha
Author-X-Name-Last: Mohan
Author-Name: Viswanath Kumar Ganesan
Author-X-Name-First: Viswanath Kumar
Author-X-Name-Last: Ganesan
Title: Order acceptance and scheduling in a parallel machine environment with weighted completion time
Abstract:
This paper studies the order acceptance and scheduling (OAS) problem in an identical parallel machine environment where orders are characterised by their revenues, processing times and weights. A mixed integer linear programming (MILP) model is presented for the problem with the objective of maximising the revenue minus the scheduling cost. The problem is <i>NP</i>- hard and a branch and bound (B%B) algorithm is developed to solve the problem. An extension of the B%B algorithm is proposed to solve very large problem instances to obtain <i>ε</i>-optimal solutions. The B%B algorithm and the extended B%B are evaluated for their performances against the solutions obtained by solving the MILP problem formulation using CPLEX solver through computational experiments. [Received 15 June 2017; Revised 2 February 2018; Accepted 10 March 2018]
Journal: European J. of Industrial Engineering
Pages: 535-557
Issue: 4
Volume: 12
Year: 2018
Keywords: order acceptance; scheduling; parallel machines; branch and bound algorithm; B%B.
File-URL: http://www.inderscience.com/link.php?id=93631
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:4:p:535-557

Template-Type: ReDIF-Article 1.0
Author-Name: Weihua Liu
Author-X-Name-First: Weihua
Author-X-Name-Last: Liu
Author-Name: Di Wang
Author-X-Name-First: Di
Author-X-Name-Last: Wang
Author-Name: Ou Tang
Author-X-Name-First: Ou
Author-X-Name-Last: Tang
Author-Name: Donglei Zhu
Author-X-Name-First: Donglei
Author-X-Name-Last: Zhu
Title: The impacts of logistics service integrator's overconfidence behaviour on supply chain decision under demand surge
Abstract:
This paper studies a two-echelon logistics service supply chain (LSSC) composed of one logistics service integrator (LSI) and one functional logistics service provider (FLSP). We develop a two-period service capacity procurement model where market demand surges in the second period. The LSI, as the Stackelberg game leader, tends to be overconfident when market demand surges. The results show that when the demand surges in the second period, if the overconfident purchasing capacity of LSI cannot meet the market demand, the overconfidence behaviour will negatively affect LSI's optimal pricing. Besides, the overconfidence behaviour leads to the lowest service level of the FLSP in the second period under demand surge. However, such negative impacts can be reduced or even eliminated in certain conditions through the FLSP-led mechanism and the dynamic wholesale price mechanism. The numerical simulation and the case study from China are used to illustrate the model and draw some conclusions. [Received 17 August 2017; Revised 19 February 2018; Accepted 30 March 2018]
Journal: European J. of Industrial Engineering
Pages: 558-597
Issue: 4
Volume: 12
Year: 2018
Keywords: logistics service capacity procurement; overconfidence; demand surge; pricing decision; service level decision.
File-URL: http://www.inderscience.com/link.php?id=93634
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:4:p:558-597

Template-Type: ReDIF-Article 1.0
Author-Name: Mumtaz Karatas
Author-X-Name-First: Mumtaz
Author-X-Name-Last: Karatas
Author-Name: Ilknur Karacan
Author-X-Name-First: Ilknur
Author-X-Name-Last: Karacan
Author-Name: Hakan Tozan
Author-X-Name-First: Hakan
Author-X-Name-Last: Tozan
Title: An integrated multi-criteria decision making methodology for health technology assessment
Abstract:
This study presents a synthesis on the application of multi-criteria decision making (MCDM) methodologies as an innovative tool to provide a more robust and reliable selection or ranking processes for health technology assessment (HTA). HTA is described as the 'systematic' evaluation of health related technologies with respect to multiple criteria. Thus, to carry out effective HTA processes, decision-makers should consider utilising integrated or hybrid decision making processes. In this study, we develop a decision support tool called 'DEMATSEL' which serves as an integrated MCDM methodology in fuzzy environments. Our integrated approach combines four widely-used MCDM methods, viz. fuzzy AHP, fuzzy TOPSIS, fuzzy VIKOR and goal programming. We demonstrate the effectiveness of our proposed novel approach on a fuzzy HTA case study of bariatric surgery selection in Turkey. [Submitted 4 July 2017; Revised 30 December 2017; Accepted 27 February 2018]
Journal: European J. of Industrial Engineering
Pages: 504-534
Issue: 4
Volume: 12
Year: 2018
Keywords: multi criteria decision making; MCDM; fuzzy theory; health technology assessment; HTA; bariatric surgery; TOPSIS; VIKOR.
File-URL: http://www.inderscience.com/link.php?id=93637
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:4:p:504-534

Template-Type: ReDIF-Article 1.0
Author-Name: Weihua Liu
Author-X-Name-First: Weihua
Author-X-Name-Last: Liu
Author-Name: Xiaoyu Yan
Author-X-Name-First: Xiaoyu
Author-X-Name-Last: Yan
Author-Name: Wanying Wei
Author-X-Name-First: Wanying
Author-X-Name-Last: Wei
Author-Name: Dong Xie
Author-X-Name-First: Dong
Author-X-Name-Last: Xie
Author-Name: Di Wang
Author-X-Name-First: Di
Author-X-Name-Last: Wang
Title: Altruistic preference for investment decisions in the logistics service supply chain
Abstract:
In order to obtain the feasible condition that both the logistics service integrator (LSI) and functional logistics service provider (FLSP) have altruistic preferences, this paper establishes four investment decision models with Stackelberg game. It is found that supply chain coordination can not be achieved when both the LSI and FLSP have altruistic preferences, then the ex-post payment contract and 'revenue sharing + franchise fee' contract are proposed to solve this problem. Some important conclusions are found. First, when both the LSI and FLSP have altruistic preferences, the utilities of LSI and FLSP are higher than the utilities when only the LSI or FLSP has an altruistic preference. Second, both contracts can increase the utilities of LSI and FLSP when the range of altruistic preference coefficients meets a specific constraint. Third, when the LSI's altruistic preference degree is equal to the FLSP's altruistic preference degree, the supply chain profit can reach the highest level. [Received 1 October 2017; Revised 3 October 2017; Accepted 15 April 2018]
Journal: European J. of Industrial Engineering
Pages: 598-635
Issue: 4
Volume: 12
Year: 2018
Keywords: altruistic preference; investment decision; supply chain coordination; ex-post payment contract.
File-URL: http://www.inderscience.com/link.php?id=93647
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:4:p:598-635

Template-Type: ReDIF-Article 1.0
Author-Name: Wei Yan
Author-X-Name-First: Wei
Author-X-Name-Last: Yan
Author-Name: Hong Liu
Author-X-Name-First: Hong
Author-X-Name-Last: Liu
Author-Name: Yusheng Liu
Author-X-Name-First: Yusheng
Author-X-Name-Last: Liu
Author-Name: Jihua Wang
Author-X-Name-First: Jihua
Author-X-Name-Last: Wang
Author-Name: Cecilia Zanni-Merk
Author-X-Name-First: Cecilia
Author-X-Name-Last: Zanni-Merk
Author-Name: Denis Cavallucci
Author-X-Name-First: Denis
Author-X-Name-Last: Cavallucci
Author-Name: Xiaodan Yan
Author-X-Name-First: Xiaodan
Author-X-Name-Last: Yan
Author-Name: Liang Zhang
Author-X-Name-First: Liang
Author-X-Name-Last: Zhang
Title: Latent semantic extraction and analysis for TRIZ-based inventive design
Abstract:
During the development of TRIZ, several knowledge sources have been developed to solve inventive problems. Even though they are about close notions, the level of detail of the descriptions is very dissimilar, making it difficult for the user to operate with them in a systematic way. To cope with this difficulty, we are interested in finding semantic links among these sources, with the goal of assisting the inventive design expert during his activities. Taking into account that all the TRIZ knowledge sources are represented as short texts and directly applying conventional topic models on such short texts may not work well, an extended latent semantic analysis model is proposed to find the missing links among the TRIZ knowledge sources. With the help of these obtained links, several heuristic abstract solutions can be obtained. In order to show this whole process, the resolution of the case of the 'Auguste Piccard's Stratostat' is elaborated in detail. [Received: 11 March 2017; Revised: 21 November 2017; Accepted 30 March 2018]
Journal: European J. of Industrial Engineering
Pages: 661-681
Issue: 5
Volume: 12
Year: 2018
Keywords: theory of inventive problem solving; TRIZ; knowledge sources; latent semantic analysis; LSA; semantic weight; term-item semantic matrix; TISM.
File-URL: http://www.inderscience.com/link.php?id=94593
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:5:p:661-681

Template-Type: ReDIF-Article 1.0
Author-Name: Jutta Geldermann
Author-X-Name-First: Jutta
Author-X-Name-Last: Geldermann
Author-Name: Nils Lerche
Author-X-Name-First: Nils
Author-X-Name-Last: Lerche
Author-Name: Juan David Sepulveda
Author-X-Name-First: Juan David
Author-X-Name-Last: Sepulveda
Title: Combining multi-criteria decision analysis and design thinking
Abstract:
Design thinking (DT) has attracted much attention in management practice as a novel problem-solving methodology. It supports and encourages collaborative creativity to solve problems in a holistically and user-centred way. Although there are similarities between DT and multi-criteria decision analysis (MCDA), such as the process orientation and stakeholder participation, there are also differences. Whereas DT mainly focuses on the innovative creation of a prototype, MCDA concentrates instead on the ranking of alternatives. In this paper, we analyse the similarities and differences of DT and MCDA. Based on this analysis, we then develop an approach to integrate elements from DT into MCDA. The stepwise procedure of the adjusted decision process from MCDA is presented in detail. Here, the approach of rapid prototyping from DT is of particular interest. Finally, we discuss the opportunities and challenges of combining multi-criteria decision analysis and design thinking. [Received 8 July 2017; Revised 23 January 2018; Revised 18 April 2018; Accepted 6 May 2018]
Journal: European J. of Industrial Engineering
Pages: 708-739
Issue: 5
Volume: 12
Year: 2018
Keywords: multi-criteria decision analysis; MCDA; multi-criteria decision making; design thinking process; design thinking tools; structured decision process; PROMETHEE; IDEO; d.school; participation; rapid prototyping.
File-URL: http://www.inderscience.com/link.php?id=94597
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:5:p:708-739

Template-Type: ReDIF-Article 1.0
Author-Name: Venkata S.S. Yadavalli
Author-X-Name-First: Venkata S.S.
Author-X-Name-Last: Yadavalli
Author-Name: S. Udayabaskaran
Author-X-Name-First: S.
Author-X-Name-Last: Udayabaskaran
Title: A single product perishable inventory system with compulsory waiting period for reordering and with stochastic lead-time
Abstract:
A continuous review of single product perishable stochastic inventory system is considered in which a reorder can be placed only after the expiry of a compulsory waiting period (CWP) even if the inventory position of the system demands an earlier placement of a reorder. There is a stochastic lead-time for replenishment. The steady-state probability distribution for the inventory level is explicitly found. Performance measures such as stationary mean number of replenishment, mean number of demand satisfied and mean number of demand lost are explicitly found. A numerical illustration is provided to highlight the behaviour of performance measures of the model. [Received 28 July 2017; Revised 10 January 2018; Accepted 13 April 2018]
Journal: European J. of Industrial Engineering
Pages: 682-707
Issue: 5
Volume: 12
Year: 2018
Keywords: stochastic inventory system; perishable item; reorder; compulsory waiting period; CWP; lead-time.
File-URL: http://www.inderscience.com/link.php?id=94598
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:5:p:682-707

Template-Type: ReDIF-Article 1.0
Author-Name: Razieh Haghighati
Author-X-Name-First: Razieh
Author-X-Name-Last: Haghighati
Author-Name: Adnan Hassan
Author-X-Name-First: Adnan
Author-X-Name-Last: Hassan
Title: Recognition performance of imputed control chart patterns using exponentially weighted moving average
Abstract:
Performance of control chart pattern recogniser (CCPR) is dependent on the quality of data. Furthermore, when data is partially missing, false alarms and misclassification rate are high. This paper studied CCPR with incomplete data and investigated effectiveness of the exponential smoothing in restoring the patterns aiming to increase the recognition accuracy. The results demonstrated that average overall recognition accuracy degrades from 99.57 (without missingness) to 76.33 in severe missingness. Classification errors in the incomplete random and trend patterns increased up to 38 and 44 times, respectively. Exponential smoothing with a constant of 0.9 is found to be an effective imputation technique. In 50% missingness, recognition accuracy of imputed dataset improved by 99.2% and 19.4% in stable and unstable patterns respectively. Type I error in trend and type II error in random and cyclic patterns were reduced significantly with EWMA imputation. Sensitivity tests proved pattern recognition using proposed imputation technique resulted in superior robustness performance. [Received 28 April 2016; Revised 4 November 2017; Accepted 26 March 2018]
Journal: European J. of Industrial Engineering
Pages: 637-660
Issue: 5
Volume: 12
Year: 2018
Keywords: control chart; pattern recognition; missing value; imputation; statistical feature; EWMA.
File-URL: http://www.inderscience.com/link.php?id=94599
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:5:p:637-660

Template-Type: ReDIF-Article 1.0
Author-Name: Katayut Kamano
Author-X-Name-First: Katayut
Author-X-Name-Last: Kamano
Author-Name: Yon-Chun Chou
Author-X-Name-First: Yon-Chun
Author-X-Name-Last: Chou
Title: A transshipment policy for dynamic pickup and delivery services with dual objectives
Abstract:
For pickup and delivery service with multiple couriers, collaboration between couriers through hub transshipment has the potential of improving customer waiting time and courier workload. However, transshipment collaboration calls for postponing the delivery of some jobs to the next time period for the benefit of the greater whole. Therefore, new ideas for mitigating the penalty on those postponed jobs should be further investigated. To this end, this paper presents an analysis of a service policy for two categories of jobs, regular and urgent, under two performance measures for a dynamic environment. For this policy, dominance relationships between routing solutions are derived. A routing method is then developed. Numerical results show that the proposed policy and method is practical in constructing an efficient front in the waiting-time and workload performance space. This paper bridges a methodology gap in applying collaborative hub transshipment to dynamic pickup and delivery services. [Received 28 February 2017; Revised 29 January 2018; Accepted 14 May 2018]
Journal: European J. of Industrial Engineering
Pages: 740-756
Issue: 5
Volume: 12
Year: 2018
Keywords: collaborative logistic; hub transshipment; dynamic pickup and delivery; efficient front.
File-URL: http://www.inderscience.com/link.php?id=94600
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:5:p:740-756

Template-Type: ReDIF-Article 1.0
Author-Name: Zakaria Yahouni
Author-X-Name-First: Zakaria
Author-X-Name-Last: Yahouni
Author-Name: Nasser Mebarki
Author-X-Name-First: Nasser
Author-X-Name-Last: Mebarki
Author-Name: Farouk Belkadi
Author-X-Name-First: Farouk
Author-X-Name-Last: Belkadi
Author-Name: Atif Shahzad
Author-X-Name-First: Atif
Author-X-Name-Last: Shahzad
Author-Name: Alain Bernard
Author-X-Name-First: Alain
Author-X-Name-Last: Bernard
Title: Human-machine cooperation in planning and scheduling: a case study on an unstable environment
Abstract:
In an industrial environment, manufacturing systems may be subject to considerable uncertainties which may lead to numerous schedule disturbances. These disturbances prevent the execution of the planned production schedule. 'groups of permutable jobs' is one of the most studied methods that deal with this drawback. It constructs a flexible solution characterised by a set of schedules, allowing a human operator to execute, in real-time, the schedule that best fits the state of the shop. However, because of the limited complexity that one human being can handle, he/she needs to cooperate with the machine in order to take efficient decisions. This paper focuses on investigating the human-machine cooperation for planning and scheduling. A new human-machine interface model assisted with a multi-indicator decision support system has been proposed and evaluated. The results show the usefulness/limits of the proposed model and provide insights into the practice of production planning and scheduling. [Received 27 October 2017; Revised 13 December 2017, 7 June 2018; Accepted 8 June 2018]
Journal: European J. of Industrial Engineering
Pages: 757-780
Issue: 6
Volume: 12
Year: 2018
Keywords: scheduling; human-machine interface; HMI; decision support system; DSS; flow shop.
File-URL: http://www.inderscience.com/link.php?id=96388
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:6:p:757-780

Template-Type: ReDIF-Article 1.0
Author-Name: Jianan Sun
Author-X-Name-First: Jianan
Author-X-Name-Last: Sun
Author-Name: Zhongdong Xiao
Author-X-Name-First: Zhongdong
Author-X-Name-Last: Xiao
Title: Channel selection for automotive parts remanufacturer under government replacement-subsidy
Abstract:
This paper considered government replacement-subsidy policy to examine the channel selection of the automotive parts remanufacturer and we constructed two channel models in which the automotive parts remanufacturer may choose the supplier mode or competitor mode. Due to the relatively low acceptance of remanufactured automotive parts in developing countries such as China, we model the two scenarios with government offering replacement-subsidy to the remanufacturer to incentivise automotive parts remanufacturing activities. Then, we discuss the impacts of the replacement-subsidy policy on the strategy of channel selection by applying a game theory method. We find that the scope of the automotive parts remanufacturer's net cost is quite vital, which is decided by the government replacement price, subsidy and costs of the remanufacturer. The subsidy and replacement price to customers have an affirmative influence on the protection of the environment within a specific range. [Received 4 September 2017; Revised 22 May 2018; Accepted 22 June 2018]
Journal: European J. of Industrial Engineering
Pages: 808-831
Issue: 6
Volume: 12
Year: 2018
Keywords: automotive parts remanufacturing; replacement; government subsidy; channel selection.
File-URL: http://www.inderscience.com/link.php?id=96389
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:6:p:808-831

Template-Type: ReDIF-Article 1.0
Author-Name: Chatdanai Kaorapapong
Author-X-Name-First: Chatdanai
Author-X-Name-Last: Kaorapapong
Author-Name: Pisal Yenradee
Author-X-Name-First: Pisal
Author-X-Name-Last: Yenradee
Title: Impact of pricing and inventory policies with benefit sharing mechanism on supply chain performances
Abstract:
This paper is to analyse impacts of pricing policies, inventory policies, and benefit sharing mechanism on supply chain (SC) performances. The novelties and theoretical contributions of this paper include a development of linear mathematical functions to represent pricing policies, especially 'every day low price' (EDLP), and explicitly considering cash as one of the performance measures in addition to profit and revenue. A mix integer linear programming (MILP) model with pricing mechanism and policy constraints is developed. A case study in plastic fashion accessory industry in Thailand is performed. Experiments are conducted to demonstrate how the proposed model is applied. The performance measures are translated into satisfaction levels and plotted in a radar chart to facilitate performance comparison among policies. Practical contribution is that this paper recommends suitable combinations of policies to match with the priority of profit, revenue, and cash performances. [Received 10 January 2018; Revised 12 June 2018; Accepted 19 June 2018]
Journal: European J. of Industrial Engineering
Pages: 781-807
Issue: 6
Volume: 12
Year: 2018
Keywords: pricing policy; inventory policy; benefit sharing mechanism; supply chain planning; mix integer linear programming; MILP.
File-URL: http://www.inderscience.com/link.php?id=96391
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:6:p:781-807

Template-Type: ReDIF-Article 1.0
Author-Name: Muhammed Emre Keskin
Author-X-Name-First: Muhammed Emre
Author-X-Name-Last: Keskin
Author-Name: Alper Döyen
Author-X-Name-First: Alper
Author-X-Name-Last: Döyen
Author-Name: Hasan Akyer
Author-X-Name-First: Hasan
Author-X-Name-Last: Akyer
Author-Name: Mehmet Güray Güler
Author-X-Name-First: Mehmet Güray
Author-X-Name-Last: Güler
Title: Examination timetabling problem with scarce resources: a case study
Abstract:
Examination timetabling problem (ETP) is one of the hardest administrative tasks that has to be undertaken at each semester in all faculties. Although the major structure of the problem remains intact, requirements may change from faculty to faculty causing major changes in the solution procedures. The number of academic staff and the level of infrastructures of newly established universities cannot keep up with the increasing number of departments and students. This scarcity brings several additional constraints to the ETP. In this study, we propose a two stage solution procedure for the ETP of such universities. We apply our solution method to a real problem. We show that better feasible solutions can be found in shorter computation times compared to commercial softwares. Moreover we show that the total examination period length can be reduced from seven days to six days with the proposed method. [Received 17 June 2017; Revised 23 April 2018; Accepted 7 July 2018]
Journal: European J. of Industrial Engineering
Pages: 855-874
Issue: 6
Volume: 12
Year: 2018
Keywords: examination timetabling; scarce resources; mixed-integer programming; optimisation; decomposition; two stage solution strategy; heuristic; industrial engineering.
File-URL: http://www.inderscience.com/link.php?id=96394
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:6:p:855-874

Template-Type: ReDIF-Article 1.0
Author-Name: Bing-Hai Zhou
Author-X-Name-First: Bing-Hai
Author-X-Name-Last: Zhou
Author-Name: Jia-Hui Xu
Author-X-Name-First: Jia-Hui
Author-X-Name-Last: Xu
Title: An adaptive large neighbourhood search-based optimisation for economic co-scheduling of mobile robots
Abstract:
The growing energy consumption and environmental pressures call for economic and friendly green manufacturing. The paper creatively studies an economic part feeding scheduling problem with a cooperative mechanism to coordinate multiple mobile robots in the fullest sense. When solving the economic co-scheduling problem in mixed-model assembly lines, this paper jointly considers the objective of energy saving as well as the robot employment cost, which incorporates traditional performance criterion with growing energy concerns. In order to improve the performance and diversity of solutions, a multi-phase adaptive search (MPAS) algorithm is proposed which is integrated with clustering heuristics, specific destroy and repair rules, adaptive selection and perturbation strategy. Computational experiments are conducted in order to test and verify the effectiveness and efficiency of the proposed MPAS algorithm. Comparison tests are carried out between the proposed MPAS and two widely-applied benchmark algorithms. The results obtained in this study might be inspiring for future studies on energy-efficient cooperative scheduling topics. [Received 16 February 2018; Revised 22 May 2018; Accepted 22 June 2018]
Journal: European J. of Industrial Engineering
Pages: 832-854
Issue: 6
Volume: 12
Year: 2018
Keywords: mobile robots; line-integrated supermarkets; energy consumption; cooperative scheduling.
File-URL: http://www.inderscience.com/link.php?id=96402
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:12:y:2018:i:6:p:832-854