Hybrid journal (It can contain Open Access articles) ISSN (Print) 1745-7645 - ISSN (Online) 1745-7653 Published by Inderscience Publishers[449 journals]

Authors:R.P. Nithya, M. Haridass Pages: 279 - 305 Abstract: This article analyses a bulk queueing system with multiple vacations, controlled arrival and breakdown. The service is done in bulk with a minimum of 'a' customers and a maximum of 'b' customers. The server is assigned for secondary jobs (vacations) repeatedly when the number of customers is inadequate to process. The arrivals are accepted with a probability α, β and γ during the busy, vacation and renovation period respectively. During a batch service, if the server breaks down with probability <i>π</i>, the service for the particular batch is processed without interruption. Upon completion of service, the renovation of service station will be considered. The probability generating function for the queue size at an arbitrary time epoch is derived. Various performance measures are obtained. A few particular cases are discussed. Maximum entropy analysis is carried out and validated through numerical illustration. The cost model is also developed to optimise the cost. Keywords: bulk arrival; batch service; multiple vacations; breakdown; controlled arrival; maximum entropy principle; MEP Citation: International Journal of Operational Research, Vol. 39, No. 3 (2020) pp. 279 - 305 PubDate: 2020-10-22T23:20:50-05:00 DOI: 10.1504/IJOR.2020.110476 Issue No:Vol. 39, No. 3 (2020)

Authors:Arash Apornak, Abbas Keramati Pages: 306 - 324 Abstract: Developments of e-commerce lead manufacturers and retailers to open direct online channel versus traditional channel in the market. In this paper we consider a supply chain consisting of a manufacturer and a retailer evaluate the impact of price schemes and cooperative advertising mechanisms on dual-channel supply chain competition in traditional and direct online channels as its setting by using Nash equilibrium and cooperative game then find the optima value of each decision variable of the study under preferred scenarios. According to the results the value of decision variables in traditional channel is more than direct online channel in both scenario and also in profit improvement part the analyses shows both channel is sensitive to demand. The results of this study can help managers to consider the interplay between the upstream and downstream entities of a dual-channel. Keywords: pricing; cooperative advertising; Nash equilibrium; cooperative game; two echelon supply chain Citation: International Journal of Operational Research, Vol. 39, No. 3 (2020) pp. 306 - 324 PubDate: 2020-10-22T23:20:50-05:00 DOI: 10.1504/IJOR.2020.110477 Issue No:Vol. 39, No. 3 (2020)

Authors:Maryam Mohammadi, Siti Nurmaya Musa, Mohd Bin Omar Pages: 325 - 363 Abstract: In this paper, a mathematical model for a multi-item multi-period capacitated lot-sizing problem in an integrated supply chain network composed of multiple suppliers, plants and distribution centres is developed. The combinations of several functions such as purchasing, production, storage, backordering and transportation are considered. The objective is to simultaneously determine the optimal raw material order quantity, production and inventory levels, and the transportation amount, so that the demand can be satisfied with the lowest possible cost. Transfer decisions between plants are made when demand at a plant can be fulfilled by other production sites to cope with the under-capacity and stock-out problems of that plant. Since the proposed model is NP-hard, a genetic algorithm is used to solve the model. To validate the results, particle swarm optimisation and imperialist competitive algorithm are applied to solve the model as well. The results show that genetic algorithm offers better solution compared to other algorithms. Keywords: capacitated lot-sizing; multi-plant; production and distribution planning; integrated supply chain; optimisation; metaheuristic algorithms; genetic algorithm; GA; particle swarm optimisation; PSO; imperialist competitive algorithm; ICA Citation: International Journal of Operational Research, Vol. 39, No. 3 (2020) pp. 325 - 363 PubDate: 2020-10-22T23:20:50-05:00 DOI: 10.1504/IJOR.2020.110478 Issue No:Vol. 39, No. 3 (2020)

Authors:Moonyoung Yoon, James Bekker Pages: 364 - 405 Abstract: Simulation optimisation is an interesting and fast-growing research field fostered by advances in computer technology and increased computing power. These advances have made it possible to solve complex stochastic optimisation problems using simulation. Most simulation optimisation studies focus on single-objective simulation optimisation (SOSO), and multi-objective simulation optimisation (MOSO) has only recently drawn attention. This paper provides an overview of recent studies on discrete MOSO problems. We surveyed various MOSO algorithms and classified them, based on: 1) the size of the feasible solution space; 2) the method of dealing with the multiple objectives. For the latter, we identified three categories, namely scalarisation methods, the constraint approach, and the Pareto approach. MOSO algorithms in each category are discussed in some detail. We conclude the paper by discussing some related issues in MOSO, which include noise handling techniques and the issue of exploration versus exploitation. Keywords: simulation; optimisation; multi-objective; ranking; selection Citation: International Journal of Operational Research, Vol. 39, No. 3 (2020) pp. 364 - 405 PubDate: 2020-10-22T23:20:50-05:00 DOI: 10.1504/IJOR.2020.110482 Issue No:Vol. 39, No. 3 (2020)

Authors:M.D.H. Gamal, Zulkarnain, M. Imran Pages: 406 - 415 Abstract: This paper proposes a constructive heuristic method to solve location-allocation problems. Specifically, we consider the problem of locating <i>m</i> new facilities in a continuous region such that the sum of the weighted distances from the new facilities to <i>n</i> existing facilities is minimised. The distance is measured using the Euclidean-distance metric. This simple technique shows that the solution found is encouraging for the case where the number of users is much larger than the number of facilities to be located. Keywords: uncapacitated continuous location; location-allocation; constructive heuristic; Euclidean-distance metric Citation: International Journal of Operational Research, Vol. 39, No. 3 (2020) pp. 406 - 415 PubDate: 2020-10-22T23:20:50-05:00 DOI: 10.1504/IJOR.2020.110483 Issue No:Vol. 39, No. 3 (2020)

Authors:Raveena Suvarna, Sunith Hebbar Pages: 416 - 438 Abstract: Economic allocation of land is an important activity in agricultural planning. Due to the changing prices of crops in market, it's vital for a farmer to appropriately allocate the land for the various crops to maximise the income. Therefore, this study focuses on allocation of land for commercial crops, namely arecanut, pepper, coconut and rubber. Initially, linear programming technique was applied to determine the optimum crop mix. The results of which is then compared with the traditional method adopted by the farmer. A sensitivity analysis was then performed to determine the optimal capital requirement. Later on to predict the behaviour of the income on a long run a SD model was developed. The factors like market price, cost of crops and weather conditions on yield were considered. The simulation results predicted that by 2030, the income will rise by 59% than the current condition if the suggested crop-mix is adopted. Keywords: commercial crops; linear programming model; optimisation of crops; system dynamics; India Citation: International Journal of Operational Research, Vol. 39, No. 3 (2020) pp. 416 - 438 PubDate: 2020-10-22T23:20:50-05:00 DOI: 10.1504/IJOR.2020.110484 Issue No:Vol. 39, No. 3 (2020)