Template-Type: ReDIF-Article 1.0 Author-Name: Sutapa Pramanik Author-X-Name-First: Sutapa Author-X-Name-Last: Pramanik Author-Name: K. Maity Author-X-Name-First: K. Author-X-Name-Last: Maity Author-Name: Dipak Kumar Jana Author-X-Name-First: Dipak Kumar Author-X-Name-Last: Jana Title: A multi-objective solid transportation problem with reliability for damageable items in random fuzzy environment Abstract: In this paper, a multi-objective solid transportation problem (MOSTP) for damageable item is formulated and solved. First, we minimised the total cost of transportation and transportation time and maximise the reliability of transportation system. Here, transportation costs, resources, demands and capacities of conveyances are random fuzzy in natures. The transported item is likely to be damaged during transportation and damageability are different for different conveyances along different roots. The solid transportation problem (STP) is formulated as a decision making model optimising possibilistic value at risk (pVaR) by incorporating the concept of value at risk (VaR) into possibility and necessity measure theory. The reduced deterministic constrained problem is solved using generalised reduced gradient (GRG) method (LINGO-14.0). Some particular models has been presented. The model is illustrated with numerical examples and some sensitivity analysis is made on damageability. Journal: Int. J. of Operational Research Pages: 1-23 Issue: 1 Volume: 31 Year: 2018 Keywords: solid transportation; random fuzzy variables; possibility; damageability; reliability. File-URL: http://www.inderscience.com/link.php?id=88555 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:1:p:1-23 Template-Type: ReDIF-Article 1.0 Author-Name: Rajesh Attri Author-X-Name-First: Rajesh Author-X-Name-Last: Attri Author-Name: Sandeep Grover Author-X-Name-First: Sandeep Author-X-Name-Last: Grover Title: Analysis of work-system design stage of production system life cycle using integrated ISM-MIMBI analysis Abstract: The work-system design stage of production system life cycle (PSLC) mainly provides structure to the productivity of an organisation. It fundamentally involves the job design, worker compensation and work study. The design of work-system is not an easy task for the managers as it is affected by a number of factors hereby known as quality enabled factors (QEFs). QEFs are those factors whose consideration will lead to the better design of work-system. The ultimate need is to analyse the behaviour of these QEFs for their effective utilisation in the work-system design. The main objective of this paper is to recognise the mutual interaction of these QEFs and recognise the 'influencing QEFs' (i.e., which influence the other QEFs) and the 'influenced QEFs' (i.e., which are influenced by other QEFs). In the current work, these QEFs have been recognised through the literature analysis and expert opinions and interpretive structural modelling (ISM) approach has been utilised in analysing their mutual interaction. Afterwards, MIMBI (where MI = measure of influencing; MBI = measure of being influenced) analysis has been applied to identify the key QEFs. At last, an integrated model based on ISM and MIMBI analysis has been developed for the effective utilisation of QEFs in the work-system design. Journal: Int. J. of Operational Research Pages: 24-48 Issue: 1 Volume: 31 Year: 2018 Keywords: quality enabled factors; QEFs; work-system; production system; interpretive structural modelling; ISM; MIMBI. File-URL: http://www.inderscience.com/link.php?id=88556 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:1:p:24-48 Template-Type: ReDIF-Article 1.0 Author-Name: Arash Mohamadi Author-X-Name-First: Arash Author-X-Name-Last: Mohamadi Author-Name: Sadoullah Ebrahimnejad Author-X-Name-First: Sadoullah Author-X-Name-Last: Ebrahimnejad Author-Name: Reza Tavakkoli-Moghaddam Author-X-Name-First: Reza Author-X-Name-Last: Tavakkoli-Moghaddam Title: A novel two-stage approach for solving a bi-objective facility layout problem Abstract: This paper presents a new heuristic algorithm for a facility layout problem in order to determine the entry order of departments and arrange them adjacent to each other. Additionally, another algorithm is developed to optimise the facility layout that minimises bi-objectives including the total material handling cost and dead space simultaneously. The optimised facility layout is determined by the use of three meta-heuristic algorithms, namely genetic algorithm (GA), particle swarm optimisation (PSO) and parallel simulated annealing (SA). This can be considered as a novel two-stage approach. The arrangement of facilities obtained by this approach is compared with the results of two other methods proposed in the literature. The comparison of the results shows the superiority of the proposed algorithms as compared to previous work. Furthermore, among the three algorithms, PSO and SA resulted in better overall performance with respect to cost and running time. Journal: Int. J. of Operational Research Pages: 49-87 Issue: 1 Volume: 31 Year: 2018 Keywords: facility layout; meta-heuristic algorithms; genetic algorithm; particle swarm optimisation; PSO; parallel simulated annealing. File-URL: http://www.inderscience.com/link.php?id=88557 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:1:p:49-87 Template-Type: ReDIF-Article 1.0 Author-Name: Komal Author-X-Name-First: Author-X-Name-Last: Komal Author-Name: S.P. Sharma Author-X-Name-First: S.P. Author-X-Name-Last: Sharma Title: Two phase approach for performance analysis and optimisation of industrial systems using uncertain data Abstract: In real life situation, it is difficult to achieve optimum performance of industrial systems for desired industrial goals using available resources. This is due to the complexity of industrial systems and nonlinearity in their behaviour. In this paper, a two-phase approach has been developed for achieving optimum performance of any industrial system. In the first phase of the presented approach, system performance is analysed in terms of six well known reliability indices by applying fuzzy lambda-tau (FLT) and genetic algorithms-based lambda-tau (GABLT) techniques utilising available uncertain data. In the second phase, a fuzzy multi-objective optimisation problem (FMOOP) has been formulated using first phase results. The obtained FMOOP is further reformulated to an equivalent crisp optimisation problem by taking care of preferences as suggested by decision maker (DM)/management personnel and then solved by using genetic algorithms (GA). The presented two-phase approach is applied to a bleaching system of a paper mill. A decision support system has been developed for achieving system optimum performance. The obtained results may be used for planning the future course of action to optimise system performance. Journal: Int. J. of Operational Research Pages: 88-111 Issue: 1 Volume: 31 Year: 2018 Keywords: performance optimisation; system behaviour; reliability indices; GABLT technique; fuzzy multi-objective optimisation problem; FMOOP; genetic algorithm. File-URL: http://www.inderscience.com/link.php?id=88558 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:1:p:88-111 Template-Type: ReDIF-Article 1.0 Author-Name: Zhixiang Chen Author-X-Name-First: Zhixiang Author-X-Name-Last: Chen Title: Optimal inventory replenishment and pricing for a single-manufacturer and multi-retailer system of deteriorating items Abstract: This paper studies an integrated optimisation model of inventory replenishment and pricing decisions in a single-manufacturer multi-retailer system of deteriorating items. Two meta-heuristic algorithms, i.e., improved particle swarm optimisation incorporated with SA mechanism (SAPSO), and a continuous domain ant colony optimisation algorithm (CDACO) are developed. Experiments show that two algorithms are effective for solving the model; however, SAPSO has higher effectiveness, efficiency and accuracy than CDACO. Sensitivity analysis shows that price elasticity coefficient significantly impacts decisions of production and retailing, giving managerial implication that reducing price fluctuation can increase profit. However, the effect of deterioration of items is not significant both for cost and profit. Journal: Int. J. of Operational Research Pages: 112-139 Issue: 1 Volume: 31 Year: 2018 Keywords: production-marketing coordination; meta-heuristics; deteriorating items; particle swarm optimisation; ant colony optimisation; ACO. File-URL: http://www.inderscience.com/link.php?id=88559 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:1:p:112-139 Template-Type: ReDIF-Article 1.0 Author-Name: S.M. Shahidul Islam Author-X-Name-First: S.M. Shahidul Author-X-Name-Last: Islam Author-Name: Mohammad Abdul Hoque Author-X-Name-First: Mohammad Abdul Author-X-Name-Last: Hoque Title: Single-vendor single-buyer optimal consignment policy with generic demand distribution by considering some realistic factors Abstract: Consignment policy (CP) is a new fruitful technique to integrated inventory supply chain management. Success of the CP mostly depends upon the vendor's and the buyer's reliable collaboration. These strategic techniques were considered in the prior models but they were dealt without taking into account some realistic factors, such as work-in-process inventory, shipping time inventory, selling period inventory of sold products, transshipment cost, ordering cost, setup cost, and buyer's warehouse capacity constraint. This study presents a single-vendor single-buyer profit maximising consignment model with generalised demand distribution but considering these factors along with the ones considered previously. This model is compared with a traditional policy (TP) model developed in the similar fashion. Numerical examples with several patterns of demand distributions are set to illustrate the policies. Results show that both parties can earn more profit under CP than that of TP. Retail price markdown is analysed for the managerial implications. Journal: Int. J. of Operational Research Pages: 141-163 Issue: 2 Volume: 31 Year: 2018 Keywords: consignment policy; integrated inventory; commission; stochastic demand; supply chain; traditional policy; transport; vendor-buyer; warehouse capacity. File-URL: http://www.inderscience.com/link.php?id=89127 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:2:p:141-163 Template-Type: ReDIF-Article 1.0 Author-Name: Tadeusz Antczak Author-X-Name-First: Tadeusz Author-X-Name-Last: Antczak Title: Semi-infinite minimax fractional programming under (Φ, ρ)-V-invexity and generalised (Φ, ρ)-V-invexity. Optimality Abstract: Semi-infinite minimax fractional programming problems with both inequality and equality constraints are considered. The sets of parametric sufficient optimality conditions for a new class of non-convex differentiable semi-infinite minimax fractional programming problems are obtained under (generalised) (Φ, <i>ρ</i>)-<i>V</i>-invexity assumptions imposed on the objective and constraint functions. With the reference to the said functions, we extend some results of optimality for a larger class of non-convex semi-infinite minimax fractional programming problems in comparison to those ones, previously established in the literature under other generalised convex notions. Journal: Int. J. of Operational Research Pages: 164-197 Issue: 2 Volume: 31 Year: 2018 Keywords: semi-infinite minimax fractional programming; (Φ, ρ)-V-invex function; (Φ, ρ)-V-pseudo-invex function; (Φ, ρ)-V-quasi-invex function; optimality conditions. File-URL: http://www.inderscience.com/link.php?id=89128 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:2:p:164-197 Template-Type: ReDIF-Article 1.0 Author-Name: Ririn Diar Astanti Author-X-Name-First: Ririn Diar Author-X-Name-Last: Astanti Author-Name: The Jin Ai Author-X-Name-First: The Jin Author-X-Name-Last: Ai Author-Name: Hunyh Trung Luong Author-X-Name-First: Hunyh Trung Author-X-Name-Last: Luong Author-Name: Hui-Ming Wee Author-X-Name-First: Hui-Ming Author-X-Name-Last: Wee Title: Two techniques for solving nonlinear decreasing demand inventory system with shortage backorders Abstract: This paper considers an inventory model with nonlinear decreasing demand and shortage backorders. Two techniques are proposed to solve the problem. The first heuristic technique is based on cost reduction concept and the second one applies the particle swarm optimisation algorithm. The results from the two proposed techniques for variable replenishment interval policies are compared with those of fixed replenishment interval policy. The computational experiments show that the total cost resulted from variable replenishment interval policy is smaller than the fixed replenishment interval policy, especially when the demand rate is highly nonlinear. Journal: Int. J. of Operational Research Pages: 198-223 Issue: 2 Volume: 31 Year: 2018 Keywords: inventory policy; nonlinear decreasing demand; particle swarm optimisation; PSO; shortage backorders; fixed replenishment; variable replenishment. File-URL: http://www.inderscience.com/link.php?id=89129 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:2:p:198-223 Template-Type: ReDIF-Article 1.0 Author-Name: Rossella Pozzi Author-X-Name-First: Rossella Author-X-Name-Last: Pozzi Author-Name: Carlo Noè Author-X-Name-First: Carlo Author-X-Name-Last: Noè Author-Name: Tommaso Rossi Author-X-Name-First: Tommaso Author-X-Name-Last: Rossi Title: A methodological approach to assess the content of work in air cargo operations Abstract: Notwithstanding, the extensive studies involving the cargo terminal operations issues, a knowledge gap emerges. Literature has focused its research on the manpower assignment and the crew scheduling problems, whereas the determination of the content of work of the activities to be performed and, as a consequence, of the manpower requirements has been often neglected. Thus, filling such a gap is the goal of the present paper, which is aimed at developing a methodological approach for defining the content of work involved in air cargo terminal activities and the corresponding manpower requirements. The proposed approach requires the participation of both cargo terminal processes supervisors and operators, and deals with both data gathering and statistical analyses, and with the definition of the variables that influence the process as well. Therefore, the developed approach has been applied to a real process, and the present paper describes the performed case study and its findings. Journal: Int. J. of Operational Research Pages: 224-244 Issue: 2 Volume: 31 Year: 2018 Keywords: air cargo terminal; manpower requirement; ANOVA. File-URL: http://www.inderscience.com/link.php?id=89130 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:2:p:224-244 Template-Type: ReDIF-Article 1.0 Author-Name: Surbhi Singhal Author-X-Name-First: Surbhi Author-X-Name-Last: Singhal Author-Name: S.R. Singh Author-X-Name-First: S.R. Author-X-Name-Last: Singh Title: Supply chain system for time and quality dependent decaying items with multiple market demand and volume flexibility Abstract: This study develops an integrated perishable items inventory replenishment model for decaying items with multiple market demand under volume flexibility. Flexibility is a desirable property of production systems which quite often is presented as a panacea to numerous realistic problems. The production rate is taken as flexible. Deterioration rate depends upon quality level and time. The time related function for deterioration follows a two-parameter Weibull distribution. Holding cost is taken as linear increasing function of time. To make the study realistic quality dependent setup cost has been taken. Numerical example along with graphical illustrations is presented to discuss the optimality of the model. Journal: Int. J. of Operational Research Pages: 245-261 Issue: 2 Volume: 31 Year: 2018 Keywords: time and quality dependent decaying items; volume flexibility; multiple market demand; variable holding cost. File-URL: http://www.inderscience.com/link.php?id=89131 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:2:p:245-261 Template-Type: ReDIF-Article 1.0 Author-Name: C. Krishnamoorthi Author-X-Name-First: C. Author-X-Name-Last: Krishnamoorthi Author-Name: V. Choudri Author-X-Name-First: V. Author-X-Name-Last: Choudri Title: An inventory model for deteriorating items with constant, linear and quadratic holding cost - a comparative study in third order equation Abstract: In the classical inventory model the holding cost was assumed to be constant. However, in reality holding cost may not always be constant. The holding cost may be time dependent. In this paper, a production inventory model with deteriorating items with constant, linear and quadratic holding cost is considered and also a comparative study is carried out between constant holding cost and time dependent (linear and quadratic) holding costs. Three models are developed. In three models, the optimum time and total cost are derived when the holding cost is: 1) constant; 2) linear; 3) quadratic. A mathematical model is developed for each model and the optimal production lot size which minimises the total cost is derived. The optimal solution is derived and an illustrative example is provided. The validation of result in this model was coded in Microsoft Visual Basic 6.0. Journal: Int. J. of Operational Research Pages: 262-280 Issue: 2 Volume: 31 Year: 2018 Keywords: inventory; deteriorating; linear; quadratic; holding cost; demand and production. File-URL: http://www.inderscience.com/link.php?id=89132 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:2:p:262-280 Template-Type: ReDIF-Article 1.0 Author-Name: Amir Karbassi Yazdi Author-X-Name-First: Amir Karbassi Author-X-Name-Last: Yazdi Author-Name: Masoud Haddadi Author-X-Name-First: Masoud Author-X-Name-Last: Haddadi Title: Prioritising critical successful factors of knowledge management in insurance companies Abstract: This article attempts to investigate the 'road map' of critical successful factors (CSFs) of knowledge management in Iranian insurance companies. In this study, we aim to identify the CSFs of knowledge management (KM) used in Iranian insurance companies and rank them to allocate limited available resources, such as time, budget and human resources, in an attempt to implement improvement programs. The Rembrandt method, being the optimised form of the analytical hierarchy process (AHP), was used to determine which critical successful factors were suitable for the implementation of knowledge management in organisations. In each organisation, there are many vital issues - some more important than others - that must be considered. No organisation can implement knowledge management improvement programs (KMIPs). In this research, we attempt to use the most important factors of each issue and, then, rank them for the sake of KM. Administrative, organisational, IT infrastructure, process perspective and human resource issues were the most important ones dealt with in this study. The road map provided in this article will help Iranian insurance managers better prioritise and allocate their limited resources to CSFs. Journal: Int. J. of Operational Research Pages: 281-299 Issue: 3 Volume: 31 Year: 2018 Keywords: knowledge management; Rembrandt method; critical successful factors; CSFs; knowledge management improvement programs; KMIPs; insurance companies. File-URL: http://www.inderscience.com/link.php?id=89732 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:3:p:281-299 Template-Type: ReDIF-Article 1.0 Author-Name: Jack Brimberg Author-X-Name-First: Jack Author-X-Name-Last: Brimberg Author-Name: Shaul P. Ladany Author-X-Name-First: Shaul P. Author-X-Name-Last: Ladany Author-Name: William J. Hurley Author-X-Name-First: William J. Author-X-Name-Last: Hurley Title: Choosing a winning team for mixed medley events Abstract: The swimming medley event consists of teams of four swimmers (all men or all women) competing to complete a medley of four strokes in the quickest time. A new idea has emerged where swimming teams of two women and two men may now compete against each other in the same medley event. This new problem may be formulated as a classical assignment problem with an additional side constraint. We propose a simple back-of-the-envelope algorithm for selecting the fastest mixed team. The mixed-medley model is also generalised to other possible sports events (e.g., in gymnastics and track and field). Reformulating the problem by standard Lagrangian relaxation allows us to solve it in an iterative fashion with the well-known Hungarian method. Thus, the problem is suitable in a classroom environment for students and practitioners of OR. Journal: Int. J. of Operational Research Pages: 300-312 Issue: 3 Volume: 31 Year: 2018 Keywords: assignment problem; sports; mixed medley events; operational research. File-URL: http://www.inderscience.com/link.php?id=89733 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:3:p:300-312 Template-Type: ReDIF-Article 1.0 Author-Name: Linh Nguyen Khanh Duong Author-X-Name-First: Linh Nguyen Khanh Author-X-Name-Last: Duong Author-Name: Lincoln C. Wood Author-X-Name-First: Lincoln C. Author-X-Name-Last: Wood Author-Name: William Y.C. Wang Author-X-Name-First: William Y.C. Author-X-Name-Last: Wang Title: A review and reflection on inventory management of perishable products in a single-echelon model Abstract: This paper reviews research on single-echelon inventory management of perishable products using the continuous review model. A steady progression of research in this area has included of a range of parameters and is reaching a saturation point where models appear effective and cover a range of realistic situations for single-echelon management. However, research has rested on the assumption that a total cost or profit metric should be used when answering the replenishment questions of when and how much to order. This total cost/profit metric is less appropriate when considering a holistic or systemic modelling of the company where the balance in measurements between departments and the continuous improvement are priority. From this perspective, we outline concerns with existing approaches using a total cost/profit metric when applied to a company. Instead of using approximation methods to optimise total costs/profits in a single department, we assert that managers should focus on multi-metric performance measures to improve system-wide results. In this paper, we present a method to compare the single-echelon replenishment model using multi-metric performance measures and those with the traditional total cost/profit metric. Journal: Int. J. of Operational Research Pages: 313-329 Issue: 3 Volume: 31 Year: 2018 Keywords: performance metrics; inventory control; perishability; continuous review; deterioration. File-URL: http://www.inderscience.com/link.php?id=89734 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:3:p:313-329 Template-Type: ReDIF-Article 1.0 Author-Name: Subramanian Pazhani Author-X-Name-First: Subramanian Author-X-Name-Last: Pazhani Author-Name: A. Ravi Ravindran Author-X-Name-First: A. Ravi Author-X-Name-Last: Ravindran Title: A bi-criteria model for closed loop supply chain network design Abstract: Closed loop supply chains (CLSC) are the integration of both forward and reverse supply chains. The integration is important as independent operations and management of forward and reverse supply chains lead to a reduction in efficiency in the supply chain as a whole. This article considers a four-stage CLSC network with commercial returns, which could be potentially recovered by light repair operations or by refurbishing. The annual estimate of commercial returns in the USA is in excess of $100 billion. This paper discusses the optimal design of a CLSC network with the objectives of maximising the profit of the supply chain and minimising the energy usage at the warehousing facilities and energy consumed during transportation. A bi-criteria mixed integer linear programming (MILP) model is developed to determine the optimal locations of the facilities and the distribution of flows between facilities in the CLSC. We propose an interactive optimisation algorithm to systematically solve the bi-criteria problem which poses less cognitive burden on the decision maker and converges faster to the best compromise solution. Journal: Int. J. of Operational Research Pages: 330-356 Issue: 3 Volume: 31 Year: 2018 Keywords: closed loop supply chain; CLSC; bi-criteria mixed integer linear program; interactive optimisation; paired comparison method; PCM. File-URL: http://www.inderscience.com/link.php?id=89735 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:3:p:330-356 Template-Type: ReDIF-Article 1.0 Author-Name: Jorge Ibarra-Salazar Author-X-Name-First: Jorge Author-X-Name-Last: Ibarra-Salazar Title: The risk averse and prudent newsboy: changes in risk and fixed costs Abstract: The classic single-period inventory problem (newsboy model) has been analysed to determine the qualitative effects of increases in the demand riskiness and of changes in fixed costs. This paper provides a sufficient condition for an increase in fixed costs to reduce orders. It has been shown that when the demand experiences a single spread around the optimal order or a restricted mean-preserving spread, the newsvendor reduces orders if he is risk averse, or prudent respectively. This paper advances such results by showing that the relation runs in both directions. That is, whenever the uncertain demand undergoes a risk increase characterised by a single spread, the newsboy will reduce orders if and only if he is risk averse; and that prudence is both necessary and sufficient condition for the newsboy to reduce orders whenever he is faced with a restricted mean-preserving spread of the random demand. Journal: Int. J. of Operational Research Pages: 357-367 Issue: 3 Volume: 31 Year: 2018 Keywords: newsboy model; inventory model; increases in risk; risk aversion; prudence. File-URL: http://www.inderscience.com/link.php?id=89736 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:3:p:357-367 Template-Type: ReDIF-Article 1.0 Author-Name: Mohamed Abd Allah El-Hadidy Author-X-Name-First: Mohamed Abd Allah Author-X-Name-Last: El-Hadidy Title: Existence of finite parbolic spiral search plan for a Brownian target Abstract: A target is assumed to move in the plane according to a two-dimensional independent Brownian motion. The searcher moves along parabolic spiral curve. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite. Journal: Int. J. of Operational Research Pages: 368-383 Issue: 3 Volume: 31 Year: 2018 Keywords: parabolic spiral search path; curvature of the search path; torsion of the search path; Brownian motion; uniformly integrable. File-URL: http://www.inderscience.com/link.php?id=89737 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:3:p:368-383 Template-Type: ReDIF-Article 1.0 Author-Name: U.K. Bhattacharya Author-X-Name-First: U.K. Author-X-Name-Last: Bhattacharya Title: A mathematical model for locating k-obnoxious facilities on a plane Abstract: This paper proposes a new mathematical model for locating k-obnoxious facilities Here a vertex covering k-obnoxious facilities location problem on a plane has been modelled by combining it as a combination of three interacting criteria as follows: 1) maximise the minimum distances between any existing point and any variable point as well as between any pair of variable points; 2) maximise the number of existing points covered by various respective variable points; 3) minimise the overall importance of the various existing points associated to the various variable facility points. A nonlinear programming iterative algorithm for locating k-obnoxious facilities has been developed. The algorithm developed here is a generalised iterative algorithm. It has been proved that the optimal solution obtained by the algorithm is the non-dominated solution of the original multi-objective problem. Rectilinear distance norm has been considered as the distance measure as it is more appropriate to the various realistic situations. Journal: Int. J. of Operational Research Pages: 384-402 Issue: 3 Volume: 31 Year: 2018 Keywords: multiple-criteria analysis; obnoxious facility location; utility approach; non-dominated solution. File-URL: http://www.inderscience.com/link.php?id=89738 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:3:p:384-402 Template-Type: ReDIF-Article 1.0 Author-Name: Hui-Ling Yang Author-X-Name-First: Hui-Ling Author-X-Name-Last: Yang Title: An optimal ordering policy for deteriorating items with partial backlogging and time varying selling price and purchasing cost under inflation Abstract: In the last several years, most countries have suffered from large-scale inflation and sharp decline in the purchasing power of money. Due to high inflation rate, the time value of money goes down and the future worth of saving decreases. As a result, large capital to purchase item is needed, the selling price and purchasing cost is also affected. Consequently, it will highly affect the return on investment. Therefore, to consider both the inflationary effect and fluctuated selling price and purchasing cost simultaneously is important. Thus, I develop the inventory lot-size model as introduced in Yang (2012) and further take the effect of inflation into account. The proposed model also allows for: 1) time-varying demand; 2) time-varying partial backlogging rate; 3) time-varying selling price and purchasing cost which changed from one replenishment cycle to another. Based on profit maximisation, the optimal replenishment schedule which maximises the total profit exists uniquely. Sensitivity analysis for managerial policymaking is also performed. From the sensitivity analysis, we know that the total profit is relatively influenced by considering the effect of inflation as the selling price and purchasing cost is fluctuated at the replenishment time. Journal: Int. J. of Operational Research Pages: 403-419 Issue: 3 Volume: 31 Year: 2018 Keywords: inventory; deterioration; partial backlogging; time varying; inflation. File-URL: http://www.inderscience.com/link.php?id=89739 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:3:p:403-419 Template-Type: ReDIF-Article 1.0 Author-Name: Reza Rashid Author-X-Name-First: Reza Author-X-Name-Last: Rashid Author-Name: Saeed Dehnavi Arani Author-X-Name-First: Saeed Dehnavi Author-X-Name-Last: Arani Author-Name: Seyed Farzad Hoseini Author-X-Name-First: Seyed Farzad Author-X-Name-Last: Hoseini Author-Name: Mohammad Mohammadpour Omran Author-X-Name-First: Mohammad Mohammadpour Author-X-Name-Last: Omran Title: A new supply chain network design approach, regarding retailer's inventory level and supplier's response time Abstract: This paper deals with the retailer's location problem, when inventory costs for retailers and response time costs for suppliers have been considered. Generally, in a supply chain, most of the parameters are not deterministic, for this reason, we considered demand and service time as stochastic parameters, and queuing theory has been used to prepare a comprehensive mathematical model. In this system, each supplier has been represented with an <i>M/M/1</i> queue and each retailer has been represented with an <i>M/M/1</i> queue with bulk arrival. Due to the computational complexity of the proposed model, a genetic algorithm has been proposed to obtain acceptable solutions in a reasonable time. Further, performance of the proposed (GA) is compared against LINGO package software for small-sized problems. Our computational results suggest that the proposed GA is able to solve our mathematical model, especially for large sizes. To evaluate performance of the model, a real example of dairy supply chains has been prepared, which confirmed efficiency of the model. Journal: Int. J. of Operational Research Pages: 421-441 Issue: 4 Volume: 31 Year: 2018 Keywords: SCM; queuing theory; inventory; response time; genetic algorithm. File-URL: http://www.inderscience.com/link.php?id=90423 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:4:p:421-441 Template-Type: ReDIF-Article 1.0 Author-Name: Kailash C. Lachhwani Author-X-Name-First: Kailash C. Author-X-Name-Last: Lachhwani Title: On solving multi-objective linear bi-level multi-follower programming problem Abstract: Multi-objective linear bi-level multi-follower programming problem (MOBLMFPP) is a special case of two level hierarchical programming problems in which the second level hierarchy includes multiple followers. This paper presents an alternate method based on fuzzy goal programming approach for the solution of multi-objective linear bi-level multi-follower programming (MOLBMFP) problem in which there is no sharing of information among followers. In the proposed FGP model formulation, each of objective functions of each level (leader and follower's level of MOLBMFPP) as well as decision variables at each level are characterised into fuzzy goals. Suitable linear membership functions are defined for each objective function and decision variables. Then minimising the sum of the negative deviational variables of both levels, the highest membership value of each of fuzzy goals is obtained. Existence of compromise optimal solution for MOLBMFPP is established in context of proposed approach. A numerical example is illustrated in support of proposed methodology. A comparative analysis is also carried out in order to show efficiency of proposed method over earlier method for the solution of MOLBMFPP. Journal: Int. J. of Operational Research Pages: 442-460 Issue: 4 Volume: 31 Year: 2018 Keywords: bi-level programming; BLP; multi-objective linear bi-level multi-follower programming; fuzzy goal programming; FGP; membership function; compromise optimal solution. File-URL: http://www.inderscience.com/link.php?id=90426 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:4:p:442-460 Template-Type: ReDIF-Article 1.0 Author-Name: K.V. Vijayashree Author-X-Name-First: K.V. Author-X-Name-Last: Vijayashree Author-Name: A. Anjuka Author-X-Name-First: A. Author-X-Name-Last: Anjuka Title: Stationary analysis of a fluid queue driven by an M/M/1/N queue with disaster and subsequent repair Abstract: This paper studies a fluid queueing model driven by an <i>M/M/</i>1<i>/N</i> queue subject to disaster and subsequent repair. The underlying system of differential difference equations that governs the process are solved using generating function methodology. Explicit expressions for the joint steady state probabilities of the state of the background queueing model and the content of the buffer are obtained in terms of modified Bessel function of the first kind. Numerical illustrations are added to support the theoretical results. Journal: Int. J. of Operational Research Pages: 461-477 Issue: 4 Volume: 31 Year: 2018 Keywords: generating function; Laplace transform; steady state probabilities; buffer content distribution; operational research; fluid queue; stationary analysis; disaster. File-URL: http://www.inderscience.com/link.php?id=90427 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:4:p:461-477 Template-Type: ReDIF-Article 1.0 Author-Name: Remica Aggarwal Author-X-Name-First: Remica Author-X-Name-Last: Aggarwal Author-Name: Sanjeet Singh Author-X-Name-First: Sanjeet Author-X-Name-Last: Singh Title: A hybrid approach for supplier selection based on revised data envelopment analytic hierarchy process Abstract: For most managers, purchasing decisions are key decisions in the achievement of business organisation's strategic objectives. Appropriate supplier selection is necessary as it fulfils these important objectives of the organisation by maximising overall value to the purchaser, reducing uncertainty in supply, and by forming a long term, reliable relationship between buyers and suppliers. Supplier selection being affected by several conflicting factors requires an appropriate multi-criteria decision making approach. One of the recent approaches used for supplier selection is a hybrid data envelopment analytic hierarchy process (DEAHP) approach. However, this approach suffers from serious drawbacks as it uses counter intuitive priority vectors for inconsistent pair wise comparison matrices and also at times, it generate illogical weights for consistent pair wise comparison matrices as well. The objective of this paper is to present a revised DEAHP (RDEAHP) approach to overcome these drawbacks of DEAHP. The uniqueness of the research lies in the application of RDEAHP approach for supplier selection problem. Journal: Int. J. of Operational Research Pages: 478-509 Issue: 4 Volume: 31 Year: 2018 Keywords: data envelopment analysis; DEA; analytic hierarchy process; AHP; DEAHP; MCDM; supply chain; supplier selection. File-URL: http://www.inderscience.com/link.php?id=90428 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:4:p:478-509 Template-Type: ReDIF-Article 1.0 Author-Name: Abhijit Baidya Author-X-Name-First: Abhijit Author-X-Name-Last: Baidya Author-Name: Uttam Kumar Bera Author-X-Name-First: Uttam Kumar Author-X-Name-Last: Bera Author-Name: Manoranjan Maiti Author-X-Name-First: Manoranjan Author-X-Name-Last: Maiti Title: Multi-item multi-stage transportation problem with breakability Abstract: In this manuscript, we formulate and solve four newly developed multi-stage multi item transportation models with breakability and restriction on transportation. Normally, due to bad condition of the road and vehicle, the breakable transported units got damaged. Here, the units are first transported from plants to distribution centres (DCs) and then from DC to customers. Four multi-item multi-stage transportation problems (MIMSTPs) are formulated to minimise the total transportation cost where the unit transportation costs, capacities of plants and DCs and demands of customers for the four models are crisp, fuzzy, stochastic and fuzzy-stochastic in nature respectively. For all models, breakability coefficient is taken deterministic. For the fuzzy model, generalised triangular fuzzy number (GTFN) and mean of cut (MC) method are considered. The chance constraint programming technique is used to find the deterministic form of the stochastic and fuzzy-stochastic models. The models are illustrated with numerical examples and solved using the LINGO-13 solver. In particular, with restricted number of DCs, the optimum results are also obtained. Some sensitivity analysis is also presented for model 1 with respect to breakability and deficit in demand. Journal: Int. J. of Operational Research Pages: 510-544 Issue: 4 Volume: 31 Year: 2018 Keywords: transportation problem; TP; multi-stage TP; breakability; space constraint; mean of α-cut; MC; method; chance constraint programming. File-URL: http://www.inderscience.com/link.php?id=90430 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:4:p:510-544 Template-Type: ReDIF-Article 1.0 Author-Name: Rajen Tibrewala Author-X-Name-First: Rajen Author-X-Name-Last: Tibrewala Author-Name: Ravi Tibrewala Author-X-Name-First: Ravi Author-X-Name-Last: Tibrewala Author-Name: P.L. Meena Author-X-Name-First: P.L. Author-X-Name-Last: Meena Title: Buy-back policy for supply chain coordination: a simple rule Abstract: In this paper, a simple and novel procedure is proposed to determine a set of buy-back prices and the wholesale costs to maximise the profit of a two-stage supply chain consisting of one supplier and one retailer. A supplier (or manufacturer) can implement a buy-back policy to influence the quantity ordered by its retailer. We have developed a simple rule to achieve channel coordination in a two-stage supply chain dealing with a limited life product. A numerical experiment has been conducted to illustrate the proposed model. Sensitivity analyses are performed to show the impact of various parameters on supply chain profit. The results depict that a higher degree of channel coordination not only increases the expected supply chain profit but also decreases the impact of demand uncertainty on expected profit. Moreover, the sensitivity results show that the increase in the degree of channel coordination decreases the coefficient of variation in retailer's profit. Finally, the implications of using these results for the managers have been discussed. Journal: Int. J. of Operational Research Pages: 545-572 Issue: 4 Volume: 31 Year: 2018 Keywords: supply chain; coordination; buy-back contract; channel coordination. File-URL: http://www.inderscience.com/link.php?id=90437 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:31:y:2018:i:4:p:545-572 Template-Type: ReDIF-Article 1.0 Author-Name: Yazan Khalid Abed-Allah Migdadi Author-X-Name-First: Yazan Khalid Abed-Allah Author-X-Name-Last: Migdadi Author-Name: Hala Sulaiman Mahmoud Al-Momani Author-X-Name-First: Hala Sulaiman Mahmoud Author-X-Name-Last: Al-Momani Title: The operational determinants of hospitals' inpatients departments efficiency in Jordan Abstract: The aim of this research is to examine the impact of hospitals operational factors on the efficiency of public hospitals' inpatient departments in Jordan as a case in developing countries. Secondary data were collected from the annual statistical reports of the Ministry of Health. 15 out of 31 hospitals were surveyed, 9 out of 12 departments were investigated. DEA (CCR) input model was used to analyse the departments' efficiency. Non-parametric statistical techniques were used to analyse the relationship between variables. This study revealed that hospital's inpatients departments were categorised into extremely high efficient, high efficient, moderate efficient, low efficient, and extremely low efficient. No significant differences were found in efficiency among departments except ear nose and throat department with some departments, and ICU department with gynecology. Also, it was found that the location of hospital, capacity, and ALOS are not determinants for efficiency of all hospitals' inpatients departments, occupancy rate is a determinant for some hospitals' efficiency. The previous studies have focused mainly on reporting efficiency at hospital level with limited concern about reporting the departments' efficiency and all of them have not investigated the impact of multi operational determinants on efficiency. Journal: Int. J. of Operational Research Pages: 1-23 Issue: 1 Volume: 32 Year: 2018 Keywords: efficiency; data envelopment analysis; DEA; average length of stay; hospitals; operations; inpatients; occupancy rate; capacity; location; determinants; Jordan. File-URL: http://www.inderscience.com/link.php?id=91199 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:1:p:1-23 Template-Type: ReDIF-Article 1.0 Author-Name: Baback Vaziri Author-X-Name-First: Baback Author-X-Name-Last: Vaziri Author-Name: Yuehwern Yih Author-X-Name-First: Yuehwern Author-X-Name-Last: Yih Author-Name: Tom Morin Author-X-Name-First: Tom Author-X-Name-Last: Morin Title: A proposed voting scheme to reduce the sensitivity of the Markov method Abstract: The Markov method is one of many successful ranking methods that uses Markov chains to obtain its ratings and rankings of alternatives. It has been shown, however, that the method is sensitive to upsets, particularly in the tail of its ranking. The method also exhibits faulty behaviour when it has a periodic Markov chain. This study proposes a modification to the voting scheme of the Markov method that will alleviate the sensitivity to upsets and remove the issue of periodicity in the Markov chain. To examine the sensitivity, we first provide an example and see how both voting schemes react to an upset. Next, we generalise both voting schemes and examine a ratio of rating increments to understand why the tailing effect occurs, and how we can subside its effect. Journal: Int. J. of Operational Research Pages: 24-40 Issue: 1 Volume: 32 Year: 2018 Keywords: ranking methods; Markov method; sensitivity; ranking vectors. File-URL: http://www.inderscience.com/link.php?id=91200 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:1:p:24-40 Template-Type: ReDIF-Article 1.0 Author-Name: Jorge Graneri Author-X-Name-First: Jorge Author-X-Name-Last: Graneri Author-Name: Sandro Moscatelli Author-X-Name-First: Sandro Author-X-Name-Last: Moscatelli Author-Name: Pablo Romero Author-X-Name-First: Pablo Author-X-Name-Last: Romero Author-Name: Libertad Tansini Author-X-Name-First: Libertad Author-X-Name-Last: Tansini Author-Name: Omar Viera Author-X-Name-First: Omar Author-X-Name-Last: Viera Title: Monte Carlo mirror algorithm for the port-of-entry inspection problem Abstract: A naive exhaustive manual inspection of port-of-entry is the most secure inspection policy. However, the number of within containers allows only to check a limited number of containers each day. The aim of this paper is to offer an automatic, simple and intuitive algorithm to select which containers should be inspected, following a given training set of classifications as close as possible. We prove that there exists an optimal deterministic inspection policy for the classification problem, called mirror solution. Inspired by the strength of Monte Carlo-based methods for simulation of rare events, we add randomisation to the mirror solution. We first show that the randomised mirror solution is useful in practice and computationally efficient, since it depends linearly on the size of the training set, for a given number of sensors and risk levels. Finally, we present the results of the proposed port-of-entry inspection policy in a real-life scenario. Journal: Int. J. of Operational Research Pages: 41-55 Issue: 1 Volume: 32 Year: 2018 Keywords: risk analysis; port-of-entry; inspection policy; Monte Carlo. File-URL: http://www.inderscience.com/link.php?id=91201 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:1:p:41-55 Template-Type: ReDIF-Article 1.0 Author-Name: Pravash Kumar Giri Author-X-Name-First: Pravash Kumar Author-X-Name-Last: Giri Author-Name: Manas Kumar Maiti Author-X-Name-First: Manas Kumar Author-X-Name-Last: Maiti Author-Name: Manoranjan Maiti Author-X-Name-First: Manoranjan Author-X-Name-Last: Maiti Title: Simulation approach to solve fuzzy fixed charge multi-item solid transportation problems under budget constraint Abstract: In this paper, we have developed a dominate-based genetic algorithm to solve fuzzy fixed charge multi-item solid transportation problems (FFCMISTPs) under budget constraint in fuzzy environment, in which sources, demands, capacities of conveyances, unit selling prices, unit purchasing costs, fixed charges, unit transportation costs and transportation times are fuzzy in nature. Here, transportation problems are formulated in the form of profit maximisation problems and solved. For maximisation, a dominate-based genetic algorithm (DBGA) with varying population size, cyclic crossover, two-point mutation is developed which can deal with single-objective transportation problems. The developed algorithm is tested against some test functions and its efficiency is established in terms of iteration numbers for single objective. The fuzzy objective function and constraints are reduced to corresponding deterministic ones using graded mean integrating value, possibility/necessity measures and chance constrained programming method. The reduced crisp problems are solved using developed genetic algorithm. The models are illustrated with numerical examples. The real life practical implication of the model is also presented. Journal: Int. J. of Operational Research Pages: 56-91 Issue: 1 Volume: 32 Year: 2018 Keywords: dominate-based genetic algorithm; DBGA; solid transportation problem; STP; fixed charge; budget constraints; possibility/necessity measure; graded mean integrated value criterion; critical value criterion; CVC. File-URL: http://www.inderscience.com/link.php?id=91202 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:1:p:56-91 Template-Type: ReDIF-Article 1.0 Author-Name: Hassan Farsijani Author-X-Name-First: Hassan Author-X-Name-Last: Farsijani Author-Name: Yazdan Shirmohammadi Author-X-Name-First: Yazdan Author-X-Name-Last: Shirmohammadi Author-Name: Seyed Hojjat Bazazzadeh Author-X-Name-First: Seyed Hojjat Author-X-Name-Last: Bazazzadeh Author-Name: Roya Eghbal Author-X-Name-First: Roya Author-X-Name-Last: Eghbal Title: Identification and prioritisation of AIDA promotion model tools by use of fuzzy AHP approach Abstract: In the modern literature of management, the responsibility of a manager is decision making. Identifying the best promotional mix element seems a crucial decision because in addition to satisfying the needs of the market, it should pay attention to the organisational objectives and marketing. Although a substantial amount of budget is devoted to promotion in the organisations, little attention paid to the effectiveness of the promotional methods and the desired result may not be achieved. So, before spending vast sums of money, best promotional mix tools should be identified in every industry based on its characteristics. In this study, we aim at helping managers in the tile and ceramic industry to identify and prioritise their promotion tools to improve their sales. AIDA model was used in this study and due to each element of AIDA, the best promotional mix tools were prioritised by FAHP. Journal: Int. J. of Operational Research Pages: 92-113 Issue: 1 Volume: 32 Year: 2018 Keywords: promotional mix; tile and ceramic industry; AIDA; fuzzy AHP. File-URL: http://www.inderscience.com/link.php?id=91203 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:1:p:92-113 Template-Type: ReDIF-Article 1.0 Author-Name: M.K. Marichelvam Author-X-Name-First: M.K. Author-X-Name-Last: Marichelvam Author-Name: A. Azhagurajan Author-X-Name-First: A. Author-X-Name-Last: Azhagurajan Author-Name: M. Geetha Author-X-Name-First: M. Author-X-Name-Last: Geetha Title: Minimisation of total tardiness in hybrid flowshop scheduling problems with sequence dependent setup times using a discrete firefly algorithm Abstract: In this paper, hybrid flowshop (HFS) scheduling problems with sequence dependent setup times (SDST) are considered. The objective is to minimise the total tardiness. As these problems were proved to be strongly NP-hard (non-deterministic polynomial time hard) type combinatorial optimisation problems, exact methods cannot be used to solve the problems. Hence, many heuristics and meta-heuristics were addressed in the literature to solve the problems. In this paper, discrete version of a recently developed bio-inspired meta-heuristic algorithm called as discrete firefly algorithm (DFA) is proposed to solve the problems. Extensive computational experiments are carried out to validate the performance of the proposed algorithm. Computational results reveal the success of the proposed algorithm. Journal: Int. J. of Operational Research Pages: 114-126 Issue: 1 Volume: 32 Year: 2018 Keywords: hybrid flowshop; scheduling; total tardiness; set up time; discrete firefly algorithm; DFA. File-URL: http://www.inderscience.com/link.php?id=91204 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:1:p:114-126 Template-Type: ReDIF-Article 1.0 Author-Name: Maziar Yazdani Author-X-Name-First: Maziar Author-X-Name-Last: Yazdani Author-Name: Fariborz Jolai Author-X-Name-First: Fariborz Author-X-Name-Last: Jolai Author-Name: Mohammad Taleghani Author-X-Name-First: Mohammad Author-X-Name-Last: Taleghani Author-Name: Reza Yazdani Author-X-Name-First: Reza Author-X-Name-Last: Yazdani Title: A modified imperialist competitive algorithm for a two-agent single-machine scheduling under periodic maintenance consideration Abstract: Scheduling with periodic maintenance has been widely studied. However, multi-agent scheduling with simultaneous considerations of periodic maintenance has hardly been considered until now. In view of this, this research focuses on the problem of scheduling jobs that come from two agents on a single machine under periodic maintenance constraint with the objective of minimising the total completion time of the jobs of the first agent while keeping the maximum tardiness of other agent below or at a fixed level UB. We present some new dominance properties for this strongly NP-hard problem. And next, using these properties, we develop a novel imperialist competitive algorithm for the problem. Various parameters of the proposed algorithm are reviewed by means of Taguchi experimental design. For the evaluation of the proposed ICA, problem data was generated to compare it against a genetic algorithm. The results of computational experiments show the good performance of the proposed algorithm. Journal: Int. J. of Operational Research Pages: 127-155 Issue: 2 Volume: 32 Year: 2018 Keywords: scheduling; two agents; single machine; periodic maintenance; imperialist competitive algorithm; ICA; dominance properties. File-URL: http://www.inderscience.com/link.php?id=92011 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:2:p:127-155 Template-Type: ReDIF-Article 1.0 Author-Name: Anu G. Aggarwal Author-X-Name-First: Anu G. Author-X-Name-Last: Aggarwal Author-Name: P.K. Kapur Author-X-Name-First: P.K. Author-X-Name-Last: Kapur Author-Name: Nidhi Nijhawan Author-X-Name-First: Nidhi Author-X-Name-Last: Nijhawan Title: A discrete SRGM for multi-release software system with faults of different severity Abstract: To meet highly competitive market challenges along with technological upgrades and changing user requirements, software firms offer newer versions of their products by adding new features and new functionalities. But this also results in increase in the fault content of software. In this paper we propose a discrete software reliability growth model (SRGM) for fault removal process incorporating the effect of up-gradations on the subsequent releases of the software. It is further assumed that faults present in the software are not of the same type and may be classified as simple and hard faults depending upon the effort and time consumed for their removal. The proposed model has been validated on a real life dataset for software with four releases. The results obtained are encouraging and fairly accurate. Journal: Int. J. of Operational Research Pages: 156-168 Issue: 2 Volume: 32 Year: 2018 Keywords: software reliability; discrete SRGM; fault removal process; multi release software; simple faults; hard faults. File-URL: http://www.inderscience.com/link.php?id=92012 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:2:p:156-168 Template-Type: ReDIF-Article 1.0 Author-Name: Asil Oztekin Author-X-Name-First: Asil Author-X-Name-Last: Oztekin Author-Name: Rory R. Masterson Author-X-Name-First: Rory R. Author-X-Name-Last: Masterson Title: A predictive analytic approach to determine construction cost estimates Abstract: In the construction industry, cost estimates are the basis for which projects are awarded to suppliers. A cost estimate is arguably the most important inclusion in a supplier's response to a customer's 'request for quote'. As such, it is essential for construction cost estimates to include features of accuracy, cost effectiveness and profitability for the supplier. The amount of variables and qualitative considerations in an estimate require a methodology beyond an objective approach. This paper uses data analytics to analyse both a US Government service provider's internal estimate process and suppliers' external estimate process to determine the best approach to use on future task orders. Three different classifier methods were used to perform the data analytic approach. Based on analyses performed for all three methods, RBF-based support vector machine with a 66%-33% random split and ten-fold cross-validation yielded the highest accuracy at 71%. Journal: Int. J. of Operational Research Pages: 169-200 Issue: 2 Volume: 32 Year: 2018 Keywords: construction estimates; decision support systems; artificial intelligence; decision tree; neural networks; support vector machines; SVMs; business analytics. File-URL: http://www.inderscience.com/link.php?id=92013 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:2:p:169-200 Template-Type: ReDIF-Article 1.0 Author-Name: Soulef Khalfallah Author-X-Name-First: Soulef Author-X-Name-Last: Khalfallah Author-Name: Zouhour Nabli Author-X-Name-First: Zouhour Author-X-Name-Last: Nabli Title: A hybrid data envelopment analysis_decision tree approach to evaluate the bi-criteria flow shop with blocking problem Abstract: The purpose of this paper is to evaluate the overall performance of a bi-objective scheduling problem using a method based on a combination of data envelopment analysis and decision tree. The hybrid approach is applied to the blocking flow shop scheduling problem with both makespan and total tardiness objectives. For this end, we propose two families of three-phase heuristics. In phase one, several constructive heuristics are used to generate initial solutions and in phase two, two improving heuristics are used to generate non-dominated solutions. One of the improving heuristics is based on the makespan criteria and the other one is based on the total tardiness criteria. The non-dominated solutions are then compared using the free disposal hull (FDH) formulation of data envelopment analysis (DEA). The overall performance of the composed heuristics is measured using a decision tree approach. Journal: Int. J. of Operational Research Pages: 201-222 Issue: 2 Volume: 32 Year: 2018 Keywords: bi-criteria; scheduling; blocking; makespan; total tardiness; data envelopment analysis; DEA; decision tree; non-dominated solutions. File-URL: http://www.inderscience.com/link.php?id=92014 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:2:p:201-222 Template-Type: ReDIF-Article 1.0 Author-Name: Hojatollah Rajabi Moshtaghi Author-X-Name-First: Hojatollah Rajabi Author-X-Name-Last: Moshtaghi Author-Name: Gholam Reza Faramarzi Author-X-Name-First: Gholam Reza Author-X-Name-Last: Faramarzi Author-Name: Reza Farzipoor Saen Author-X-Name-First: Reza Farzipoor Author-X-Name-Last: Saen Title: Developing new methods for determining weights of components in network data envelopment analysis Abstract: Data envelopment analysis (DEA) is a powerful tool for measuring relative efficiency of decision-making units (DMUs). In many cases such DMUs have network structures with internal structures. Traditional DEA models, however, consider DMUs as black boxes without considering their internal structures. Furthermore, overall efficiency in multi component networks is based on efficiencies of their components. Cook et al. (2010) used the additive weighted average of components' efficiencies to calculate overall efficiency. They used the ratio of total weighted input of component to total weighted input of whole components as a weight of component. As an alternative approach, Faramarzi et al. (2014) proposed that the weights are the ratio of total weighted output at the <i>i</i><SUP align="right"><SMALL>th</SMALL></SUP> component to total weighted output of whole components. In this paper, we propose three novel methods to obtain the weights of components. Then, to compare these three new methods and the methods proposed by Cook et al. (2010) and Faramarzi et al. (2014), we present a case study. Finally, using Spearman's rank correlation coefficient, we analyse the correlation among different approaches. Journal: Int. J. of Operational Research Pages: 223-250 Issue: 2 Volume: 32 Year: 2018 Keywords: network data envelopment analysis; NDEA; refineries; multi-component network; Spearman's rank correlation. File-URL: http://www.inderscience.com/link.php?id=92015 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:2:p:223-250 Template-Type: ReDIF-Article 1.0 Author-Name: Yigal Gerchak Author-X-Name-First: Yigal Author-X-Name-Last: Gerchak Author-Name: Gilad Schwartz Author-X-Name-First: Gilad Author-X-Name-Last: Schwartz Title: Supply chain coordination with multiple retailers and nonlinear production costs Abstract: We consider coordination with multiple retailers when supplier's production costs are nonlinear. Microeconomics typically assumes increasing marginal production costs (i.e., convex production costs). The nonlinearity of the production costs introduces indirect dependence among the retailers, as the order quantity of one influences the cost of producing the others' lots. We consider a fixed retail price scenario, as well as price-dependent linear additive and iso-elastic demands. We explore these scenarios under wholesale-price-only contract, as well as revenue sharing contract. Journal: Int. J. of Operational Research Pages: 251-265 Issue: 2 Volume: 32 Year: 2018 Keywords: coordination; nonlinear costs; multiple retailers. File-URL: http://www.inderscience.com/link.php?id=92016 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:2:p:251-265 Template-Type: ReDIF-Article 1.0 Author-Name: Eduardo Pérez Author-X-Name-First: Eduardo Author-X-Name-Last: Pérez Author-Name: Rahul R. Ambati Author-X-Name-First: Rahul R. Author-X-Name-Last: Ambati Author-Name: Alex J. Ruiz-Torres Author-X-Name-First: Alex J. Author-X-Name-Last: Ruiz-Torres Title: Maximising the number of on-time jobs on parallel servers with sequence dependent deteriorating processing times and periodic maintenance Abstract: This paper considers a parallel-machine scheduling problem with sequence dependent processing times and periodic maintenance. The time to complete jobs increases as the machines deteriorate and the machine deterioration depends on the particular job sequence assigned to a machine. The planned maintenance activity returns the machine to its optimal condition, and all machines undergo this maintenance activity at the same time. The objective is to find the job schedule that maximises the number of on-time jobs given a specified maintenance schedule. The paper presents a mathematical programming formulation, several solution algorithms, and evaluates their performance under various experimental conditions. Journal: Int. J. of Operational Research Pages: 267-289 Issue: 3 Volume: 32 Year: 2018 Keywords: parallel machines; machine deterioration; late jobs; on-time jobs; scheduling; maintenance. File-URL: http://www.inderscience.com/link.php?id=92735 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:3:p:267-289 Template-Type: ReDIF-Article 1.0 Author-Name: Lihua Chen Author-X-Name-First: Lihua Author-X-Name-Last: Chen Author-Name: Alfred L. Guiffrida Author-X-Name-First: Alfred L. Author-X-Name-Last: Guiffrida Author-Name: Pratim Datta Author-X-Name-First: Pratim Author-X-Name-Last: Datta Title: Capacity-delivery coordination in supply chains: a cost-based approach Abstract: We develop a cost-based model considering a two-stage supply chain with a buyer ordering from a supplier. The model is constructed to coordinate the supply chain by joint decisions over delivery performance and capacity management. In this model, the supplier randomly assigns a portion of his permanent capacity to the buyer and the buyer determines his order quantity accordingly. A delivery window is used to classify deliveries as early, on-time or late and is used to evaluate the delivery performance of the supplier when delivery time is governed by a truncated normal probability density function. Numerical sensitivity analyses are presented to illustrate the significant managerial implications of this model. Journal: Int. J. of Operational Research Pages: 290-312 Issue: 3 Volume: 32 Year: 2018 Keywords: supply chain coordination; delivery timeliness; capacity allocation. File-URL: http://www.inderscience.com/link.php?id=92736 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:3:p:290-312 Template-Type: ReDIF-Article 1.0 Author-Name: Trust Tawanda Author-X-Name-First: Trust Author-X-Name-Last: Tawanda Title: Determining k-possible critical paths using Tawanda's non-iterative optimal tree algorithm for shortest route problems Abstract: The critical path method (CPM) is a project modelling algorithm developed in the 1950s for scheduling project activities, it is used to determine the critical path through the calculation of three parameters thus, slack, earliest event, latest event times for each activity. In this paper, we demonstrate how to use Tawanda's non-iterative optimal tree algorithm for shortest route problems (TA) to determine the critical path(s). We have also compared TA with the original critical path method (CPM) and the modified Dijksra's algorithm for critical path method in a project network (MDA). However, the study revealed that TA can compute the critical path more effectively since it is also effective in project networks with k-possible critical paths, moreover, it does not make use of the slack, earliest, and latest time parameters, since these calculations consume more time. Journal: Int. J. of Operational Research Pages: 313-328 Issue: 3 Volume: 32 Year: 2018 Keywords: Dijkstra's algorithm; critical path method; CPM; critical path; project network; graph expansion; slack time. File-URL: http://www.inderscience.com/link.php?id=92737 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:3:p:313-328 Template-Type: ReDIF-Article 1.0 Author-Name: M. Sanjai Author-X-Name-First: M. Author-X-Name-Last: Sanjai Author-Name: S. Periyasamy Author-X-Name-First: S. Author-X-Name-Last: Periyasamy Title: Production inventory model with reworking of imperfect items and integrates cost reduction delivery policy Abstract: The classical EPQ model assumes that all items manufactured are of perfect quality. However, in real life production systems, due to various controllable and/or uncontrollable factors, the generation of defective items during a production run seems to be inevitable they should be reworked. A portion of non-conforming items produced is considered to be scrap, while the rest reworked in each cycle. This paper integrates cost reduction delivery policy into production inventory model with defective items with scrap and rework and finished items can only be delivered to customers at a fixed interval of time during production downtime with the purpose of reducing holding cost. A suitable mathematical model is developed and the optimal production lot size which minimises the total cost is derived. An illustrative example is provided and numerically verified. The validation of result in this model was coded in Microsoft Visual Basic 6.0. Journal: Int. J. of Operational Research Pages: 329-349 Issue: 3 Volume: 32 Year: 2018 Keywords: inventory; defective items; delivery policy; rework; scrap; demand and production. File-URL: http://www.inderscience.com/link.php?id=92738 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:3:p:329-349 Template-Type: ReDIF-Article 1.0 Author-Name: Rossella Pozzi Author-X-Name-First: Rossella Author-X-Name-Last: Pozzi Author-Name: Fernanda Strozzi Author-X-Name-First: Fernanda Author-X-Name-Last: Strozzi Author-Name: Tommaso Rossi Author-X-Name-First: Tommaso Author-X-Name-Last: Rossi Author-Name: Carlo Noè Author-X-Name-First: Carlo Author-X-Name-Last: Noè Title: Quantifying the benefits of the lean thinking adoption by the beer game supply chain Abstract: Benefits obtained by the adoption of lean thinking are often declared in the literature but not measured both at local and global level. In this work, the benefits quantification of an adoption of a lean thinking order policy is measured in the case of beer game supply chain modelled by Thomsen et al. (1992) considering the impact on bullwhip effect and inventory both on a supply chain level and on a single stage level. The paper shows that lean thinking provides major benefits to the whole supply chain in terms of bullwhip effect and carried inventory if more and more levels apply it. On the other hand, the paper highlights that these benefits not always hold locally, i.e., for some levels can be more profitable when no levels apply an order policy lean thinking-based. Journal: Int. J. of Operational Research Pages: 350-363 Issue: 3 Volume: 32 Year: 2018 Keywords: lean thinking; bullwhip effect; beer game. File-URL: http://www.inderscience.com/link.php?id=92739 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:3:p:350-363 Template-Type: ReDIF-Article 1.0 Author-Name: Sunny Kapoor Author-X-Name-First: Sunny Author-X-Name-Last: Kapoor Author-Name: Rajeev Kumar Author-X-Name-First: Rajeev Author-X-Name-Last: Kumar Title: Stochastic analysis of a base transceiver system considering traffic congestion and chances of hardware/software expansions Abstract: Base transceiver station is a critical part in a mobile communication system and its performance and cost play a significant role in network survivability and communication. The paper proposes a stochastic model for a base transceiver station that may encounter hardware and software faults, traffic congestion and common cause failures. The possibility of occurrence of hardware-based software failure is also considered. On failure of the system, the technicians first inspect whether there is hardware or software or hardware-based software fault and then carries out recovery of the relevant component. In the system there may be minor or major hardware/software faults or common cause failures where a minor fault leads to degradation whereas a major fault/common cause failure leads to complete failure of the system. Further, network traffic congestion is considered to be automatically removed and in case not, the technician will inspect the system for the purpose of hardware or software expansions. Using Markov process and regenerative point technique, various measures of system performance are obtained. On the basis of these measures, profit analysis of the system is also carried out. Various conclusions about reliability, performance and profit of the system are made on the basis of the graphical studies. Journal: Int. J. of Operational Research Pages: 364-379 Issue: 3 Volume: 32 Year: 2018 Keywords: base transceiver station; BTS; hardware-based software fault; common cause failure; mean time to system failure; expected congestion time; hardware expansion; software expansion; expected uptime/degradation time; profit; Markov process; regenerative point technique. File-URL: http://www.inderscience.com/link.php?id=92740 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:3:p:364-379 Template-Type: ReDIF-Article 1.0 Author-Name: Michael Dreyfuss Author-X-Name-First: Michael Author-X-Name-Last: Dreyfuss Author-Name: Alan Stulman Author-X-Name-First: Alan Author-X-Name-Last: Stulman Title: Waiting time distribution for an exchangeable item repair system with two failed components Abstract: Models involving exchangeable component repair systems are widely treated in the literature. In such systems, a customer arrives at a repair queue with a failed component which is replaced from stocks of previously repaired components. Various strategies and service measures have been discussed. Customers who arrive with a single failed component type will be referred to the appropriate service queue which will exchange the failed component. The waiting time distribution for a single failed component has also been developed. The development of the waiting time distribution for a single queue servicing multiple component failures has been neglected. There are many instances where two distinct components are linked so that one failure will cause the failure of the second. Finding the waiting time distribution for the customer is important because it can lead to better facility planning and realistic service measures. For example, how many extra spares should be in the system so as to limit the probability of waiting more than an acceptable amount of time (the window fill rate). We limit our development to the case of two failed components; however, the ideas developed may be extendable to more than just two failed component. Journal: Int. J. of Operational Research Pages: 380-396 Issue: 3 Volume: 32 Year: 2018 Keywords: spares; queues; exchangeable-item repair system; window fill rate; ample servers. File-URL: http://www.inderscience.com/link.php?id=92741 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:3:p:380-396 Template-Type: ReDIF-Article 1.0 Author-Name: Martin Steinrücke Author-X-Name-First: Martin Author-X-Name-Last: Steinrücke Author-Name: Michael Jahr Author-X-Name-First: Michael Author-X-Name-Last: Jahr Title: Simultaneous optimisation of forward and reverse distribution processes with multiple types of reuse within an industrial tool supply chain Abstract: In this article, we present a quantitative approach for the simultaneous coordination of forward and reverse material flows which is motivated by a real-life case of an international supply chain network in the industrial tool industry. The objective is to optimise the quantitative supply chain network processes related to procurement, production and transportation. Moreover, we consider multiple types of reuse, including remanufacturing and recycling processes, in a medium-term planning horizon. To model the three echelon production-distribution network, mixed integer linear programming is used as it offers a modular modelling technique. The implementation of a quantitative plan in a complex business network structure requires a big-bucket model solution to grant the plan's stability via sufficient time buffers. The main contribution of the paper can be found in the combined remanufacturing and recycling in a quantitative planning model, when the interdependencies between new and used products are relevant and significant. Journal: Int. J. of Operational Research Pages: 397-420 Issue: 4 Volume: 32 Year: 2018 Keywords: transportation; distribution and logistics; procurement/purchasing processes; supply chain management; mathematical modelling. File-URL: http://www.inderscience.com/link.php?id=93505 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:4:p:397-420 Template-Type: ReDIF-Article 1.0 Author-Name: Xiaobin Wu Author-X-Name-First: Xiaobin Author-X-Name-Last: Wu Author-Name: Lei Cao Author-X-Name-First: Lei Author-X-Name-Last: Cao Title: Using heuristic MCMC method for terminal location planning in intermodal transportation Abstract: In this paper, we consider the planning of terminal locations for intermodal transportation systems. With a given number of potential locations, we aim to find the most appropriate number of those as terminals to provide the economically most efficient operation when multiple service pairs are needed simultaneously. The problem also has an inherent task to determine the optimal route paths for each service pair. For this NP-hard problem, we present a Markov chain Monte Carlo (MCMC)-based two-layer method to find a suboptimal solution. In the lower layer, the routing for all service pairs given a particular location planning is solved through a table-based heuristic method that considers both efficiency and fairness. In the upper layer, by mapping the cost function into a stationary distribution, the optimal planning is solved based on a MCMC method that integrates advantages of both simulated annealing and slice sampling. Finally, the effectiveness of this heuristic MCMC-based method is demonstrated through computer experiments. Journal: Int. J. of Operational Research Pages: 421-442 Issue: 4 Volume: 32 Year: 2018 Keywords: heuristic optimisation; Markov chain Monte Carlo; MCMC; simulated annealing; slice sampling; multimodal transportation; terminal location. File-URL: http://www.inderscience.com/link.php?id=93506 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:4:p:421-442 Template-Type: ReDIF-Article 1.0 Author-Name: Surinder Kumar Author-X-Name-First: Surinder Author-X-Name-Last: Kumar Author-Name: Tilak Raj Author-X-Name-First: Tilak Author-X-Name-Last: Raj Title: GTA-based framework for evaluating the effectiveness of material handling equipment's in FMS environment Abstract: In this paper, a methodology to evaluate the effectiveness of material handling equipments variables using graph theoretic approach (GTA) is presented. Variables affecting the effectiveness of material handling equipments and their interactions are analysed by developing a mathematical model using GTA. Permanent function performance index is obtained from the matrix model developed from the digraph. This permanent function value ranks the equipment variables which help in selection of optimum process parameters during flexible and automated material handling system adoption. Journal: Int. J. of Operational Research Pages: 443-471 Issue: 4 Volume: 32 Year: 2018 Keywords: graph theoretic approach; GTA; material handling; equipment; variables; digraph; effectiveness. File-URL: http://www.inderscience.com/link.php?id=93507 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:4:p:443-471 Template-Type: ReDIF-Article 1.0 Author-Name: P. Selvaraju Author-X-Name-First: P. Author-X-Name-Last: Selvaraju Author-Name: S. Kumara Ghuru Author-X-Name-First: S. Kumara Author-X-Name-Last: Ghuru Title: Imperfect production system with rework and scrap at a single stage manufacturing system and integrates cost reduction delivery policy Abstract: This paper deals with a production inventory model with reworkable defective items and integrates a cost reduction delivery policy. In this work, it is assumed that in each cycle the rework process of all defective items starts when the regular production process finishes. After the rework process, a portion of reworked items fails and this portion becomes scrap. In this paper, two models are developed, in the first model, the perfect finished items can be delivered to customers at the end of rework process and in the second model, integrates cost reduction delivery policy and finished items can only be delivered to customers at a fixed interval of time during production down time with the purpose of reducing holding cost. The objective is to derive the optimal production lot size, number of deliveries and the finished items are delivered by request to customers at a fixed interval of time that minimises total costs. The relevant model is built, solved and necessary and sufficient conditions for a unique and global optimal solution are derived. An illustrative example is provided and numerically verified. The validation of result in this model was coded in Microsoft Visual Basic 6.0. Journal: Int. J. of Operational Research Pages: 472-494 Issue: 4 Volume: 32 Year: 2018 Keywords: EPQ model; optimum quantity; periodic deliveries; production; rework; scrap; defective rate. File-URL: http://www.inderscience.com/link.php?id=93508 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:4:p:472-494 Template-Type: ReDIF-Article 1.0 Author-Name: Chuda Basnet Author-X-Name-First: Chuda Author-X-Name-Last: Basnet Title: Heuristics for the multiple knapsack problem with conflicts Abstract: In this paper we discuss a variant of the 0-1 knapsack problem, where there are multiple knapsacks to fill with items that have profits and sizes associated with them. The objective is to maximise the profit by selecting items to fill the knapsacks within their space constraints. In the version of the problem considered in this paper, some of the items are incompatible with each other, and cannot be placed together in the same knapsack. We apply some newly developed heuristics to the problem and compare the results with those found by a commercial optimisation package. Computational results are presented. The contributions of this paper are an upper bound, and the heuristics developed and tested in this paper. Journal: Int. J. of Operational Research Pages: 514-525 Issue: 4 Volume: 32 Year: 2018 Keywords: multiple knapsack; graph colouring; heuristic algorithms; incompatibility constraints. File-URL: http://www.inderscience.com/link.php?id=93509 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:4:p:514-525 Template-Type: ReDIF-Article 1.0 Author-Name: Narmada Ranarahu Author-X-Name-First: Narmada Author-X-Name-Last: Ranarahu Author-Name: Jayanta Kumar Dash Author-X-Name-First: Jayanta Kumar Author-X-Name-Last: Dash Author-Name: Srikumar Acharya Author-X-Name-First: Srikumar Author-X-Name-Last: Acharya Title: Multi-objective fuzzy quadratic probabilistic programming problem involving fuzzy Cauchy random variable Abstract: In this paper, we have proposed a method for solving a multi-objective quadratic probabilistic programming problem, where the objective functions are multi-objective and quadratic in nature. The right hand side parameters are fuzzy Cauchy distributed independent random variable with location parameter <i>δ</i> and scale parameter <i>β</i>. The proposed mathematical programming problem is solved using two steps. First, the fuzziness is removed by using alpha cut technique and randomness is removed by chance constrained method. In second step, weighting method is used to solve the transformed multi-objective quadratic mathematical programming. This mathematical model is solved by existing methodology or software. A numerical example is presented to illustrate the efficiency and feasibility of the proposed method. Journal: Int. J. of Operational Research Pages: 495-513 Issue: 4 Volume: 32 Year: 2018 Keywords: stochastic programming; multi-objective programming; fuzzy programming; Cauchy random variables; optimisation techniques. File-URL: http://www.inderscience.com/link.php?id=93517 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:32:y:2018:i:4:p:495-513 Template-Type: ReDIF-Article 1.0 Author-Name: Satyendra Kumar Sharma Author-X-Name-First: Satyendra Kumar Author-X-Name-Last: Sharma Author-Name: Srikanta Routroy Author-X-Name-First: Srikanta Author-X-Name-Last: Routroy Author-Name: Utkarsh Yadav Author-X-Name-First: Utkarsh Author-X-Name-Last: Yadav Title: Vehicle routing problem: recent literature review of its variants Abstract: The vehicle routing problem is the most studied combinatorial optimisation problem. The purpose of this study is to provide an overview of the research to date in vehicle routing problem variants. The literature is reviewed with a focus on research in three major variants of the vehicle routing problem, namely capacitated vehicle routing problem, mixed depot vehicle routing problem and vehicle routing problem with pickup and delivery. Journal articles from three academic databases, namely Taylor and Francis, Elsevier and Emerald, are selected and reviewed. Ample literature is available on this problem so to restrict the scope, we screened the journal articles using the above mentioned variants precisely, excluding those that are in combination with other variants. This review takes a closer look at 117 research articles selected from various journals. By presenting the past literature, we hope to motivate further research in the field. Journal: Int. J. of Operational Research Pages: 1-31 Issue: 1 Volume: 33 Year: 2018 Keywords: vehicle routing problems; VRPs; literature review. File-URL: http://www.inderscience.com/link.php?id=94229 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:1:p:1-31 Template-Type: ReDIF-Article 1.0 Author-Name: Vo Hung Duong Author-X-Name-First: Vo Hung Author-X-Name-Last: Duong Author-Name: Nguyen Hung Bui Author-X-Name-First: Nguyen Hung Author-X-Name-Last: Bui Title: A mixed-integer linear formulation for a capacitated facility location problem in supply chain network design Abstract: In this research, we deal with a multi-item, multi-period, two-echelon capacitated facility location problem. With every period in horizon planning, manufacturing plants and distribution centres are decided to open or not at predetermined potential sites. The developed model is formulated as a mixed integer linear programming (MILP) model with the objective of minimising the total cost, including transportation cost, inventory holding cost, and fixed costs for opening facilities. We employ a Lagrangian relaxation algorithm for solving the developed model. Before decomposition into sub-problems, the initial structure of developed model is modified, three additional constraint sets add to two sub-problems, and these are the key differences of our algorithm. For validation testing, some numerical experiments are used for solving, and the solutions obtained from the Lagrangian relaxation algorithm are respectively compared with the solutions obtained by the LINGO solver. With good achievements of this research, our proposed model can be applied and the proposed approach is an advantage for getting the specific solutions. Journal: Int. J. of Operational Research Pages: 32-54 Issue: 1 Volume: 33 Year: 2018 Keywords: logistics; supply chain; mixed integer linear programming; MILP; Lagrangian relaxation; network design. File-URL: http://www.inderscience.com/link.php?id=94230 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:1:p:32-54 Template-Type: ReDIF-Article 1.0 Author-Name: D. Arivudainambi Author-X-Name-First: D. Author-X-Name-Last: Arivudainambi Author-Name: M. Gowsalya Author-X-Name-First: M. Author-X-Name-Last: Gowsalya Title: A single server non-Markovian retrial queue with two types of service and Bernoulli vacation Abstract: A single server retrial queueing system with two types of service and Bernoulli vacation is analysed in this paper. It is assumed that the arriving job finds the server busy by providing either type of service is said to be in orbit with an FCFS discipline and repeat its request (demand) for service after some random time. The customer at the head of the orbit is allowed to access the server. For such queueing model, the system size probabilities are investigated in steady state by using supplementary variable technique. The effects of various parameters on the system performance are analysed numerically. Stochastic decomposition and some special cases of interest are also discussed. Journal: Int. J. of Operational Research Pages: 55-81 Issue: 1 Volume: 33 Year: 2018 Keywords: retrial queues; two types of service; Bernoulli vacation; steady state; stochastic decomposition. File-URL: http://www.inderscience.com/link.php?id=94231 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:1:p:55-81 Template-Type: ReDIF-Article 1.0 Author-Name: Raghu Nandan Giri Author-X-Name-First: Raghu Nandan Author-X-Name-Last: Giri Author-Name: Shyamal Kumar Mondal Author-X-Name-First: Shyamal Kumar Author-X-Name-Last: Mondal Author-Name: Manoranjan Maiti Author-X-Name-First: Manoranjan Author-X-Name-Last: Maiti Title: Joint replenishment models with ramp demands and price dependent substitute ratio during stock-out Abstract: The paper deals with a single period joint replenishment model (JRM) of two substitutable items with ramp type demands in an inventory system. Here customers' demands are a dynamic, quadratic function of time, <i>t</i>. It is assumed that when an item is out of stock, demand for this item is partially met by the other available substitute item on the basis of items' prices difference. A new substitute function is presented here for this purpose. We determine the optimal order quantities of each item for maximum average total profit. Also attention is paid to maintain a balance between stocks of the items - i.e. not to have too much or very insufficient stock of the items at the end of a cycle. The models are illustrated with numerical data and some sensitivity analyses, and managerial insights are presented. Results of several particular models including the correct results of Salameh et al.'s (2014) model are derived from the general model. Journal: Int. J. of Operational Research Pages: 82-100 Issue: 1 Volume: 33 Year: 2018 Keywords: joint replenishment model; ramp demand; substitute items; substitute ratio. File-URL: http://www.inderscience.com/link.php?id=94232 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:1:p:82-100 Template-Type: ReDIF-Article 1.0 Author-Name: Priyanka Chaturvedi Author-X-Name-First: Priyanka Author-X-Name-Last: Chaturvedi Author-Name: Ashutosh Sarkar Author-X-Name-First: Ashutosh Author-X-Name-Last: Sarkar Author-Name: Gautam C. Majumdar Author-X-Name-First: Gautam C. Author-X-Name-Last: Majumdar Author-Name: Sarada P. Sarmah Author-X-Name-First: Sarada P. Author-X-Name-Last: Sarmah Author-Name: Sidhartha S. Padhi Author-X-Name-First: Sidhartha S. Author-X-Name-Last: Padhi Title: Milk procurement of a private dairy firm: an economic analysis Abstract: In this paper, we study the milk procurement system of a private dairy firm that buys milk from two channels, namely from farmers and through intermediaries. The collected milk is processed into value-added products, such as butter, ghee, yoghurt etc. In India, milk is predominantly collected through cooperatives and most often the farmers are stakeholders of such cooperatives. Further, the intermediaries also sell their milk to the local market and hence, behave opportunistically. Therefore, availability of milk for the private dairy firm becomes critical and depends on market principles. The game played between the intermediary and the dairy has been modelled as a Stackellberg game and expressions for their optimal decisions are obtained. Based on data collected from a private dairy firm, we carried out numerical analysis to understand the behaviour of the intermediary and the dairy firm. Journal: Int. J. of Operational Research Pages: 101-126 Issue: 1 Volume: 33 Year: 2018 Keywords: supply chain; procurement; supply chain coordination; supply contract. File-URL: http://www.inderscience.com/link.php?id=94233 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:1:p:101-126 Template-Type: ReDIF-Article 1.0 Author-Name: Mª Dolores López Author-X-Name-First: Mª Dolores Author-X-Name-Last: López Author-Name: Javier Rodrigo Author-X-Name-First: Javier Author-X-Name-Last: Rodrigo Author-Name: Sagrario Lantarón Author-X-Name-First: Sagrario Author-X-Name-Last: Lantarón Title: Searching for optimal positions through directional data in a political competition model Abstract: This paper considers an application of directional data to political science. A model is presented in which the political preferences of the type of voters of a population are represented as points of the circumference unit with the political parties searching for optimal positions on this in order to gain the most support of that finite set of voter types. Strategies have been developed to search for optimal positions in the case of one party and Nash equilibrium positions are found in the game with two parties. The results reveal how the different parties redirect their stances to adapt to changing situations generated by economic or social circumstances affecting citizen preferences. Journal: Int. J. of Operational Research Pages: 127-138 Issue: 1 Volume: 33 Year: 2018 Keywords: political competition; game theory; Nash equilibrium; applications of OR techniques; geometric programming; exact algorithms; optimisation; OR models. File-URL: http://www.inderscience.com/link.php?id=94234 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:1:p:127-138 Template-Type: ReDIF-Article 1.0 Author-Name: Reza Ahmadi Author-X-Name-First: Reza Author-X-Name-Last: Ahmadi Title: A probabilistic model for maintaining and optimising the life-cycle performance of deteriorating structures Abstract: Benefiting from a devised imperfect repair model and given a cost structure, this paper addresses the problem of determining an optimal inspection and threshold-type repair policy for systems whose performance is described by a Wiener process. The system is monitored at periodic times and preventive maintenance actions are carried out in response to the observed system state. The approach can deal with failures defined by performance or regulations. Precisely speaking, failure is defined by a critical set such that the first entry of the performance process to the critical set implies system failure. This approach is typically appropriate for lifecycle models as a specific performance requirement is, or is close to being violated. Since there is a random amount of maintenance, and on the other hand each maintenance incurs a cost, using the renewal-reward theorem, this paper aims at joint determination of an optimal inspection and repair policy providing a right balance between the amount of maintenance and the increasing cost. Benefiting from an imperfect repair model, the presented probabilistic model provides a framework for further developments. Journal: Int. J. of Operational Research Pages: 256-276 Issue: 2 Volume: 33 Year: 2018 Keywords: inspection; integral equations; renewal reward theorem; imperfect repair model; maintenance. File-URL: http://www.inderscience.com/link.php?id=95194 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:2:p:256-276 Template-Type: ReDIF-Article 1.0 Author-Name: Mhand Hifi Author-X-Name-First: Mhand Author-X-Name-Last: Hifi Author-Name: Labib Yousef Author-X-Name-First: Labib Author-X-Name-Last: Yousef Title: A global dichotomous search-based heuristic for the three-dimensional sphere packing problem Abstract: In this paper, we propose a global dichotomous search-based heuristic for solving the three-dimensional sphere packing problem. In the sphere packing problem, we are given a set of predefined unequal spheres and a large container with unlimited length. The goal of the problem is to determine the minimum length of the container that contains all spheres without overlapping. We propose to optimise the length of the large container by applying a truncated tree-search that combines a hill-climbing strategy, a hybrid operator that combines both priority and total-cost operators and, a dichotomous interval search in order to diversify the search space. Further, in order to enhance the quality of solutions of internal nodes, a local dichotomous search is applied almost of using a descent method. The proposed method is evaluated on benchmark instances taken from the literature and its provided results are compared to those reached by recent published methods in the literature. The proposed method is able to improve most solutions available in the literature. Journal: Int. J. of Operational Research Pages: 139-160 Issue: 2 Volume: 33 Year: 2018 Keywords: dichotomous; heuristic; hill-climbing; optimisation; tree-search; packing. File-URL: http://www.inderscience.com/link.php?id=95195 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:2:p:139-160 Template-Type: ReDIF-Article 1.0 Author-Name: Ruchira Chakrabarty Author-X-Name-First: Ruchira Author-X-Name-Last: Chakrabarty Author-Name: Tapan Roy Author-X-Name-First: Tapan Author-X-Name-Last: Roy Author-Name: Kripasindhu Chaudhuri Author-X-Name-First: Kripasindhu Author-X-Name-Last: Chaudhuri Title: A production-inventory model with stochastic lead time and JIT set up cost Abstract: We developed this inventory model under price dependent demand in stochastic environment. Here probabilistic lead time is considered and shortages are allowed (if occur) over a finite time horizon. Generalising the work of Maiti et al. (2009) more precisely, we consider this model with just-in-time set up cost where deterioration is taken into account and backlogging rate has been considered as a negative exponential function of the waiting time. Taking all these into account, mathematical expression for expected average profit is derived. A closed form of analytic solution for maximising the expected average profit function is obtained when demand is constant. Numerical examples are carried out to identify the most sensitive parameter. Journal: Int. J. of Operational Research Pages: 161-178 Issue: 2 Volume: 33 Year: 2018 Keywords: inventory; stochastic lead time; JIT set up cost; deterioration; partial backlogging; price dependent demand. File-URL: http://www.inderscience.com/link.php?id=95196 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:2:p:161-178 Template-Type: ReDIF-Article 1.0 Author-Name: Chirag Surti Author-X-Name-First: Chirag Author-X-Name-Last: Surti Author-Name: Prakash Abad Author-X-Name-First: Prakash Author-X-Name-Last: Abad Author-Name: Elkafi Hassini Author-X-Name-First: Elkafi Author-X-Name-Last: Hassini Title: Impact of inventory cannibalisation on a retailer selling substitutes Abstract: The reasons customers substitute, are well understood from an economic perspective. However, its exact impact on retailer's inventory and profit is not, when customers substitute as a result of a shortage. Shortage of one product may lead to demand spillover, due to substitution, resulting in shortages for the second product. We call this inventory cannibalisation. This is a store level, retailer observed phenomenon that is a direct result of customers' willingness to switch between substitutes due to stockout of one product. Many retailers are experiencing stockouts related to substitution, resulting in a significant loss of revenue. We model a retailer's selling two substitutes, facing price-sensitive stochastic demand. Our model incorporates cannibalisation explicitly and generalises the existing literature on inventory substitution. We perform analytical and numerical analysis to study the impact of stockout-based substitution and the related inventory cannibalisation on retailer's decisions. We find that the impact of cannibalisation is felt most acutely by the retailer for products with low degree of substitution. Journal: Int. J. of Operational Research Pages: 179-207 Issue: 2 Volume: 33 Year: 2018 Keywords: pricing; stock outs; substitution; inventory management; inventory cannibalisation; retail operations. File-URL: http://www.inderscience.com/link.php?id=95197 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:2:p:179-207 Template-Type: ReDIF-Article 1.0 Author-Name: Aineth Torres-Ruiz Author-X-Name-First: Aineth Author-X-Name-Last: Torres-Ruiz Author-Name: A. Ravindran Author-X-Name-First: A. Author-X-Name-Last: Ravindran Title: Multiobjective optimisation model for the selection of critical suppliers integrating sustainability criteria Abstract: Most companies are seeking their supplier base around the world. However, sourcing from a global supply base exposes buying companies to a notable set of risks and naturally increases transportation distance with the associated environmental consequences. In this study, we propose a multiobjective order allocation model for selecting primary and backup suppliers in a global supply chain setting. Our model explicitly minimises product costs, transportation costs and the cost of exceeding CO<SUB align="right"><SMALL>2</SMALL></SUB> allowances within total procurement cost, while also minimising lead-time, sustainability risks and greenhouse gas (GHG) emissions. We present a case study where our model is applied to a global manufacturer of consumer goods and the current supply scenario is compared against an optimal scenario given by the proposed model. Even though total procurement cost is given the highest priority, the optimal scenario (which assigns orders to primary suppliers locally located) represents important advantages in relation to all the criteria evaluated. Journal: Int. J. of Operational Research Pages: 208-238 Issue: 2 Volume: 33 Year: 2018 Keywords: supplier selection; supply risk; green procurement; multiobjective optimisation; goal programming; sustainable procurement; global supply chain; GHG emissions. File-URL: http://www.inderscience.com/link.php?id=95198 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:2:p:208-238 Template-Type: ReDIF-Article 1.0 Author-Name: Kais Zaman Author-X-Name-First: Kais Author-X-Name-Last: Zaman Author-Name: Subrata Kumar Saha Author-X-Name-First: Subrata Kumar Author-X-Name-Last: Saha Title: An efficient methodology for robust assignment problem Abstract: This paper proposes formulations and algorithms for assignment problem under natural or physical variability, from the perspective of robustness of the assignment. We formulate the robust assignment problem as a nonlinear binary programming problem. An equivalent linear binary programming formulation and a modified Hungarian approach are then proposed to achieve computational efficiency. The proposed methods are illustrated for two example problems, where the information on the problem parameters is available as their means and standard deviations. Journal: Int. J. of Operational Research Pages: 239-255 Issue: 2 Volume: 33 Year: 2018 Keywords: assignment problem; uncertainty; multi-objective optimisation; robust optimisation. File-URL: http://www.inderscience.com/link.php?id=95199 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:2:p:239-255 Template-Type: ReDIF-Article 1.0 Author-Name: Shirsendu Nandi Author-X-Name-First: Shirsendu Author-X-Name-Last: Nandi Title: Analysis of results obtained on return contracts with warranty Abstract: Literature on supply chain contract has extensively dealt with the coordination models with respect to different supply chain contracts and different properties and results obtained in the said context. The current study obtains results for coordination involving different contract parameters, exogenous variables when a warranty clause is also considered along with two return policy contracts viz: buyback contract and quantity flexibility contract. It also investigates whether the key properties hold good in this extended model where warranty related variables are also considered. The study provides a guideline to the channel coordinator to optimally design the contract parameters and warranty length to achieve channel coordination and optimal supply chain profit. The model is built considering a two stage supply chain and is applicable to different demand distributions. The theoretical results discussed in the present study can be suitably used in designing contracts and warranty parameters in different supply chains. Journal: Int. J. of Operational Research Pages: 277-296 Issue: 3 Volume: 33 Year: 2018 Keywords: buyback; quantity flexibility; supply chain coordination; warranty; supply chain contract. File-URL: http://www.inderscience.com/link.php?id=95622 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:3:p:277-296 Template-Type: ReDIF-Article 1.0 Author-Name: Mohamed Abd Allah El-Hadidy Author-X-Name-First: Mohamed Abd Allah Author-X-Name-Last: El-Hadidy Title: Study on the three players' linear rendezvous search problem Abstract: This paper considers the symmetric rendezvous problem of three players on the line. This problem asks how the players forced to use the same mixed strategy, can minimise their expected meeting time. This minimum is called the 'symmetric' rendezvous value of the line. In our problem we consider the effect on rendezvous time of giving the players some information about past actions and chance moves, enabling each of them to apply Bayesian updates to improve the knowledge of the other's whereabouts. This technique can be used to give lower bounds on rendezvous time of the original game (without any revealed information). Our approach is to concentrate on a general analysis of the effect of revelations, rather than compute the best bounds possible with our techniques. Journal: Int. J. of Operational Research Pages: 297-314 Issue: 3 Volume: 33 Year: 2018 Keywords: rendezvous search problem; mixed strategy; Bayesian updates. File-URL: http://www.inderscience.com/link.php?id=95623 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:3:p:297-314 Template-Type: ReDIF-Article 1.0 Author-Name: Manoranjan De Author-X-Name-First: Manoranjan Author-X-Name-Last: De Author-Name: Barun Das Author-X-Name-First: Barun Author-X-Name-Last: Das Author-Name: Manoranjan Maiti Author-X-Name-First: Manoranjan Author-X-Name-Last: Maiti Title: An economic production lot size model for randomly imperfect production system with stock-dependent demand and rework Abstract: This paper considers a single item, imperfect economic production lot-size (EPL) model with stock-dependent demand and partial rework. In real life EPL models, defective production commences from the out-of-control state, after the passage of some time from production commencement. Its occurrence is random after the lapse of certain time and imposed here through a chance constraint. The set-up cost is partly production dependent. Unit production cost is also production dependent and a part of it is taken as environment protection cost. Defective rate is also assumed to be random and production dependent. The model is formulated as an average cost minimisation problem subject to a chance constraint and solved using a nonlinear optimisation technique - generalised reduced gradient (GRG) method through LINGO 11.0. Several special cases are derived and more specifically, the present investigation the works of Sana (2010) and Khouja and Mehrez (1994). Numerical experiments are performed to illustrate the general and particular models. Some sensitivity analyses are presented against few model parameters. Journal: Int. J. of Operational Research Pages: 315-350 Issue: 3 Volume: 33 Year: 2018 Keywords: imperfect production system; stock-dependent demand; random defective rate; chance constraints; environment protection cost. File-URL: http://www.inderscience.com/link.php?id=95624 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:3:p:315-350 Template-Type: ReDIF-Article 1.0 Author-Name: Sujeet Kumar Sharma Author-X-Name-First: Sujeet Kumar Author-X-Name-Last: Sharma Author-Name: Srikrishna Madhumohan Govindaluri Author-X-Name-First: Srikrishna Madhumohan Author-X-Name-Last: Govindaluri Author-Name: Gholam R. Amin Author-X-Name-First: Gholam R. Author-X-Name-Last: Amin Title: Metasearch aggregation using linear programming and neural networks Abstract: A metasearch engine aggregates the retrieved results of multiple search engines for a submitted query. The purpose of this paper is to formulate a metasearch aggregation using linear programming and neural networks by incorporating the importance weights of the involved search engines. A two-stage methodology is introduced where the importance weights of individual search engines are determined using a neural network model. The weights are then used by a linear programming model for aggregating the final ranked list. The results from the proposed method are compared with the results obtained from a simple model that assumes subjective weights for search engines. The comparison of the two sets of results shows that neural network-based linear programming model is superior in optimising the relevance of aggregated results. Journal: Int. J. of Operational Research Pages: 351-366 Issue: 3 Volume: 33 Year: 2018 Keywords: metasearch; search engine; data aggregation; linear programming; neural networks. File-URL: http://www.inderscience.com/link.php?id=95625 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:3:p:351-366 Template-Type: ReDIF-Article 1.0 Author-Name: Ankur Chauhan Author-X-Name-First: Ankur Author-X-Name-Last: Chauhan Author-Name: Amol Singh Author-X-Name-First: Amol Author-X-Name-Last: Singh Author-Name: Sanjay Jharkharia Author-X-Name-First: Sanjay Author-X-Name-Last: Jharkharia Title: Healthcare waste management practices' identification and evaluation to rank hospitals Abstract: In the present study, various criteria (practices) have been identified from the literature of healthcare waste management. The analytic hierarchy process (AHP) has been applied to compute the weights of these criteria. The weight of a criterion shows its significance for healthcare waste management. Furthermore, the weights of criteria have been used as an input to Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), for ranking six alternatives (hospitals) to demonstrate the assessment methodology in real time. The literary contribution of this work is the identification of HCWM practices, which can be very useful in the assessment of the hospital's waste management planning, shown by the case study. Journal: Int. J. of Operational Research Pages: 367-386 Issue: 3 Volume: 33 Year: 2018 Keywords: healthcare waste management; HCWM; policy making; MCDM; analytic hierarchy process; AHP; TOPSIS. File-URL: http://www.inderscience.com/link.php?id=95626 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:3:p:367-386 Template-Type: ReDIF-Article 1.0 Author-Name: Sudha Khambhampati Author-X-Name-First: Sudha Author-X-Name-Last: Khambhampati Author-Name: Prasad Calyam Author-X-Name-First: Prasad Author-X-Name-Last: Calyam Author-Name: Xinhui Zhang Author-X-Name-First: Xinhui Author-X-Name-Last: Zhang Title: A tabu search algorithm for a capacitated clustering problem Abstract: This paper investigates a clustering problem in a production and routing environment where a centralised facility uses a fleet of vehicles to serve a set of customers. A multi-period capacitated clustering problem is solved to partition customer into clusters with constraints that the accumulated customer demand in every period of the planning horizon is satisfied. The resulting mathematical model is hard to solve exactly and efficient heuristics are thus developed in this paper. The heuristics are based on the tabu search but include two novel features in the design of neighbourhood search; the first one is the dynamic combination of customers with close proximity into supernodes to eliminate ineffective moves and the second one is an ejection chain approach to perform composite moves of variable length from a series of simple moves. Computational results showed that they were able to provide superior solutions, especially in certain cases of tight capacity constraints. Journal: Int. J. of Operational Research Pages: 387-412 Issue: 3 Volume: 33 Year: 2018 Keywords: capacitated clustering; heuristics; supernode; ejection chain; tabu search. File-URL: http://www.inderscience.com/link.php?id=95627 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:3:p:387-412 Template-Type: ReDIF-Article 1.0 Author-Name: Amir Karbassi Yazdi Author-X-Name-First: Amir Karbassi Author-X-Name-Last: Yazdi Author-Name: Yong J. Wang Author-X-Name-First: Yong J. Author-X-Name-Last: Wang Author-Name: Abotorab Alirezaei Author-X-Name-First: Abotorab Author-X-Name-Last: Alirezaei Title: Analytical insights into firm performance: a fuzzy clustering approach for data envelopment analysis classification Abstract: Many companies use data envelopment analysis (DEA) as a method for measuring performance and benchmarking with other organisations. The aim of this study is to describe a new approach for data envelopment analysis (DEA) classification based on fuzzy clustering. The new method is used for clustering decision-making units (DMUs) and ranks them from the least priority cluster to highest priority cluster. Thus, inefficient clusters can be identified as compared to efficient clusters. This study evaluates 25 insurance companies based on output oriented CCR methods, and the result shows that ten companies belong to the efficient cluster. Thus, decision makers in the inefficient cluster can benchmark with their efficient counterparts to achieve better performance. Journal: Int. J. of Operational Research Pages: 413-429 Issue: 3 Volume: 33 Year: 2018 Keywords: data envelopment analysis; DEA; fuzzy clustering; triangular fuzzy number; insurance company; performance; data analysis; decision-making unit; DMU; industry analysis; efficiency; cluster. File-URL: http://www.inderscience.com/link.php?id=95630 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:3:p:413-429 Template-Type: ReDIF-Article 1.0 Author-Name: Mrinal Jana Author-X-Name-First: Mrinal Author-X-Name-Last: Jana Author-Name: Geetanjali Panda Author-X-Name-First: Geetanjali Author-X-Name-Last: Panda Title: LR-optimal solution of nonlinear optimisation problem with varying parameters Abstract: In this paper, a nonlinear optimisation problem is studied in uncertain environment. The objective function and constraints of this problem are interval valued functions. The solution of the problem is defined with respect to <i>LR</i>-partial order relation, and methodology is developed to derive these solutions. The proposed methodology is illustrated through numerical examples. A possible application of the optimisation model in finance is described at the end. Journal: Int. J. of Operational Research Pages: 431-445 Issue: 4 Volume: 33 Year: 2018 Keywords: nonlinear optimisation problem; interval analysis; interval valued function; partial order relation; decision-making problem. File-URL: http://www.inderscience.com/link.php?id=96485 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:4:p:431-445 Template-Type: ReDIF-Article 1.0 Author-Name: Ateka Banu Author-X-Name-First: Ateka Author-X-Name-Last: Banu Author-Name: Shyamal Kumar Mondal Author-X-Name-First: Shyamal Kumar Author-X-Name-Last: Mondal Title: An inventory model of deteriorating items with a credit period-based new demand function in a finite time horizon Abstract: In today's competitive market, the trade credit plays an important role to increase demands of customers/buyers. Here, we consider a two-level trade credit policy in which a delay in payment is offered by supplier to retailer and also an another delay in payment is offered by retailer to his/her all customers. In this model, it is proposed that the demand function is dependent on the length of the customer's credit period and also the duration of offering the credit period. The purpose of this model is to establish a deterministic EOQ model of deteriorating items for the retailer to maximise the total profit and the number of replenishment cycle in finite time horizon. We develop an algorithm to find out the optimal solutions. Also, the model is explained with the help of numerical examples and sensitivity analysis is given to illustrate the features of the proposed model with respect to some parameters. Journal: Int. J. of Operational Research Pages: 446-461 Issue: 4 Volume: 33 Year: 2018 Keywords: inventory; deterioration; two-level credit financing; credit period dependent demand; inflation. File-URL: http://www.inderscience.com/link.php?id=96486 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:4:p:446-461 Template-Type: ReDIF-Article 1.0 Author-Name: P. Selvaraju Author-X-Name-First: P. Author-X-Name-Last: Selvaraju Author-Name: S. Kumara Ghuru Author-X-Name-First: S. Kumara Author-X-Name-Last: Ghuru Title: EOQ models for deteriorative items with constant, linear and quadratic holding cost and shortages - a comparative study Abstract: In the classical inventory model the holding cost was assumed to be constant. However, in reality, holding cost may not always be constant. The holding cost may be time dependent. In this paper, a production inventory model with deteriorating items with constant, linear and quadratic holding cost is considered and also a comparative study is carried out between constant, linear and quadratic holding costs. Three models are developed. In three models, the optimum time and total cost are derived when the holding cost is: 1) constant; 2) linear; 3) quadratic. A mathematical model is developed for each model and the optimal production lot size which minimises the total cost is derived. The optimal solution is derived and an illustrative example is provided. The validation of result in this model was coded in Microsoft Visual Basic 6.0. Journal: Int. J. of Operational Research Pages: 462-480 Issue: 4 Volume: 33 Year: 2018 Keywords: inventory; deteriorating; linear; quadratic; holding cost; demand and production. File-URL: http://www.inderscience.com/link.php?id=96487 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:4:p:462-480 Template-Type: ReDIF-Article 1.0 Author-Name: Diatha Krishna Sundar Author-X-Name-First: Diatha Krishna Author-X-Name-Last: Sundar Author-Name: K. Ravikumar Author-X-Name-First: K. Author-X-Name-Last: Ravikumar Author-Name: Siddharth Mahajan Author-X-Name-First: Siddharth Author-X-Name-Last: Mahajan Title: The distribution free newsboy problem with partial information Abstract: We present a new ordering rule for the newsboy problem where besides the mean and variance of demand, the probability that the demand assumes the value zero is known. We derive a lower bound for the expected profit over the set of distributions with given parameters and construct a distribution which achieves the bound. We apply our analysis to an M/G/1 queue with server vacations, which is the base model for many production-inventory systems. Journal: Int. J. of Operational Research Pages: 481-496 Issue: 4 Volume: 33 Year: 2018 Keywords: newsboy problem; inventory control; server vacations; M/G/1 queue. File-URL: http://www.inderscience.com/link.php?id=96488 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:4:p:481-496 Template-Type: ReDIF-Article 1.0 Author-Name: Juan R. Jaramillo Author-X-Name-First: Juan R. Author-X-Name-Last: Jaramillo Author-Name: Alan McKendall Author-X-Name-First: Alan Author-X-Name-Last: McKendall Title: A memetic algorithm for the generalised machine layout problem Abstract: Designing efficient machine layouts is a key issue to ensure profitability in manufacturing environments. The major decisions in designing machine layouts are: the selection of machines (including machine replicas); the assigning of machines to the plant floor; the selection of production mix (i.e., determine the products to be produced); and the assigning of products to machines (i.e., determining the product flows). The generalised machine layout problem (GMALP) integrates these factors under a single problem. The contribution of this paper is the development of a memetic algorithm for the GMALP. The memetic algorithm takes advantage of the diversification strategies of the genetic algorithm combined with the intensification strategies of tabu search. Results obtained with the memetic algorithm compares favourably with the results presented in the literature. Journal: Int. J. of Operational Research Pages: 497-511 Issue: 4 Volume: 33 Year: 2018 Keywords: memetic algorithm; generalised machine layout problem; GMALP; machine layout problem; MLP; evolutionary algorithms; tabu search; TS. File-URL: http://www.inderscience.com/link.php?id=96489 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:4:p:497-511 Template-Type: ReDIF-Article 1.0 Author-Name: Ramtin Moeini Author-X-Name-First: Ramtin Author-X-Name-Last: Moeini Title: Different hydraulic analysis conditions for sewer network design optimisation problem using three different evolutionary algorithms Abstract: In this paper, the efficiency of considering the constant and varying Manning coefficient for a hydraulic analysis model on the optimal solution of sewer network design optimisation problem is studied. To solve sewer network design optimisation problem, here, different formulations are proposed using genetic algorithm, discreet and continues ant colony optimisation algorithms. In all proposed formulations, the nodal cover depths of the sewer network are taken as decision variables of the problem. Furthermore, for both ant-based algorithms two different formulations are proposed using unconstrained and constrained versions of these algorithms. The constrained versions of these algorithms are proposed here for the explicit satisfaction of the minimum pipe slope constraint leading to smaller search space. Two benchmark test examples are solved here using proposed formulations and the results are presented and compared with other available results. Comparison of the results shows the superiority of considering varying Manning coefficient condition for hydraulic analysis model. Furthermore, the results show the superiority of continues ant colony optimisation algorithm and especially the constrained version of it to optimally solve the sewer network design optimisation problem. Journal: Int. J. of Operational Research Pages: 512-537 Issue: 4 Volume: 33 Year: 2018 Keywords: Manning coefficient; hydraulic analysis model; sewer network; genetic algorithm; discrete ant colony optimisation algorithm; continuous ant colony optimisation algorithm. File-URL: http://www.inderscience.com/link.php?id=96490 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:4:p:512-537 Template-Type: ReDIF-Article 1.0 Author-Name: Maxim A. Bushuev Author-X-Name-First: Maxim A. Author-X-Name-Last: Bushuev Author-Name: Alfred L. Guiffrida Author-X-Name-First: Alfred L. Author-X-Name-Last: Guiffrida Author-Name: Tatiana Rudchenko Author-X-Name-First: Tatiana Author-X-Name-Last: Rudchenko Title: Supply chain delivery performance improvement for several delivery time distributions Abstract: This paper investigates strategies for improving supply chain delivery performance when the cumulative density function of the delivery time distribution exists in closed form. Delivery performance is measured using a cost-based analytical model which evaluates the expected cost for early and late delivery. The effect of changes to the parameters of the delivery time distribution on the expected cost of untimely delivery is explored. Strategies for improving delivery performance utilising the mean and variance of the delivery time distribution are studied for the uniform, exponential, and logistic delivery time distributions when a supplier uses an optimally positioned delivery window to minimise the expected cost of untimely delivery. Theoretical and managerial implications of the findings are discussed. Journal: Int. J. of Operational Research Pages: 538-558 Issue: 4 Volume: 33 Year: 2018 Keywords: supply chain management; delivery performance; continuous improvement. File-URL: http://www.inderscience.com/link.php?id=96491 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijores:v:33:y:2018:i:4:p:538-558