1. Applying queuing theory for a reliable integrated location –inventory problem under facility disruption risks

Masoud Rabbani; Leyla Aliabadi; Razieh Heidari; Hamed Farrokhi-Asl

Volume 4, Issue 2 , Summer and Autumn 2017, Pages 1-18

http://dx.doi.org/10.22116/jiems.2017.54601

Abstract
  This study considers a reliable location – inventory problem for a supply chain system comprising one supplier, multiple distribution centers (DCs), and multiple retailers in which we determine DCs location, inventory replenishment decisions and assignment retailers to DCs, simultaneously. Each ...  Read More

2. Performance of CCC-r control chart with variable sampling intervals

Mohammad Saber Fallah nezhad; Yousof Shamstabar; Mohammad Mahdi Vali Siar

Volume 4, Issue 2 , Summer and Autumn 2017, Pages 19-34

http://dx.doi.org/10.22116/jiems.2017.54603

Abstract
  The CCC-r chart is developed based on cumulative count of a conforming (CCC) control chart that considers the cumulative number of items inspected until observing r nonconforming ones. Typically, the samples obtained from the process are analyzed through 100% inspection to exploit the CCC-r chart. However, ...  Read More

3. A Simulation Approach to Evaluate Performance Indices of Fuzzy Exponential Queuing System (An M/M/C Model in a Banking Case Study)

Mohammad Ehsanifar; Nima Hamta; Mahshid Hemesy

Volume 4, Issue 2 , Summer and Autumn 2017, Pages 35-51

http://dx.doi.org/10.22116/jiems.2017.54604

Abstract
  This paper includes a simulation model built in order to predict the performance indicessuch aswaiting time by analyzing queue’s components in the real world under uncertain and subjective situation. The objective of this paper is to predict the waiting time of each customer in an M/M/C queuing ...  Read More

4. A Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)

Mansoureh Maadi; Mohammad Javidnia

Volume 4, Issue 2 , Summer and Autumn 2017, Pages 52-63

http://dx.doi.org/10.22116/jiems.2017.54606

Abstract
  Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP ...  Read More

5. A discrete-event optimization framework for mixed-speed train timetabling problem

Seyyed Akbar Gholamian

Volume 4, Issue 2 , Summer and Autumn 2017, Pages 64-84

http://dx.doi.org/10.22116/jiems.2017.54607

Abstract
  Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single ...  Read More

6. A New Model to Speculate CLV Based on Markov Chain Model

M. J. Tarokh; Mahsa EsmaeiliGookeh

Volume 4, Issue 2 , Summer and Autumn 2017, Pages 85-102

http://dx.doi.org/10.22116/jiems.2017.54609

Abstract
  The present study attempts to establish a new framework to speculate customer lifetime value by a stochastic approach. In this research the customer lifetime value is considered as combination of customer’s present and future value. At first step of our desired model, it is essential to define ...  Read More