Robust simulation optimization using φ-divergence
, Pages: 517-534
Samira Moghaddam and Hashem Mahlooji PDF (685K)
Abstract: We introduce a new robust simulation optimization method in which the probability of occurrence of uncertain parameters is considered. It is assumed that the probability distributions are unknown but historical data are on hand and using φ-divergence functionality the uncertainty region for the uncertain probability vector is defined. We propose two approaches to formulate the robust counterpart problem for the objective function estimated by Kriging. The first method is a minimax problem and the second method is based on the chance constraint definition. To illustrate the methods and assess their performance, numerical experiments are conducted. Results show that the second method obtains better robust solutions with less simulation runs.
Keywords: Simulation optimization, Kriging metamodel, Robust optimization, φ-divergence
A robust optimization model for blood supply chain in emergency situations
, Pages: 535-554
Meysam Fereiduni and Kamran Shahanaghi PDF (685K)
Abstract: In this paper, a multi-period model for blood supply chain in emergency situation is presented to optimize decisions related to locate blood facilities and distribute blood products after natural disasters. In disastrous situations, uncertainty is an inseparable part of humanitarian logistics and blood supply chain as well. This paper proposes a robust network to capture the uncertain nature of blood supply chain during and after disasters. This study considers donor points, blood facilities, processing and testing labs, and hospitals as the components of blood supply chain. In addition, this paper makes location and allocation decisions for multiple post disaster periods through real data. The study compares the performances of “p-robust optimization” approach and “robust optimization” approach and the results are discussed.
Keywords: Blood supply chain, Humanitarian logistics, Robust optimization, P-robust approach, Uncertainty programing
Buffer clustering policy for sequential production lines with deterministic processing times
, Pages: 555-572
Francesca Schuler and Houshang Darabi PDF (685K)
Abstract: A sequential production line is defined as a set of sequential operations within a factory or distribution center whereby entities undergo one or more processes to produce a final product. Sequential production lines may gain efficiencies such as increased throughput or reduced work in progress by utilizing specific configurations while maintaining the chronological order of operations. One problem identified by the authors via a case study is that, some of the configurations, such as work cell or U-shaped production lines that have groups of buffers, often increase the space utilization. Therefore, many facilities do not take advantage of the configuration efficiencies that a work cell or U-shaped production line provide. To solve this problem, the authors introduce the concept of a buffer cluster. The production line implemented with one or more buffer clusters maintains the throughput of the line, identical to that with dedicated buffers, but with the clusters reduces the buffer storage space. The paper derives a time based parametric model that determines the sizing of the buffer cluster, provides a reduced time space for which to search for the buffer cluster sizing, and determines an optimal buffer clustering policy that can be applied to any N-server, N+1 buffer sequential line configuration with deterministic processing time. This solution reduces the buffer storage space utilized while ensuring no overflows or underflows occur in the buffer. Furthermore, the paper demonstrates how the buffer clustering policy serves as an input into a facility layout tool that provides the optimal production line layout.
Keywords: Sequential, Production, Buffer, Cluster, Deterministic, Configuration
Integrated approach in solving parallel machine scheduling and location (ScheLoc) problem
, Pages: 573-584
Mohsen Rajabzadeh, Mohsen Ziaee and Ali Bozorgi-Amiri PDF (685K)
Abstract: Scheduling and layout planning are two important areas of operations research, which are used in the areas of production planning, logistics and supply chain management. In many industries locations of machines are not specified, previously, therefore, it is necessary to consider both location and scheduling, simultaneously. This paper presents a mathematical model to consider both scheduling and layout planning for parallel machines in discrete and continuous spaces, concurrently. The preliminary results have indicated that the integrated model is capable of handling problems more efficiently.
Keywords: Scheduling, Layout planning, Parallel machines
An alternative hybrid evolutionary technique focused on allocating machines and sequencing operations
, Pages: 585-596
Mariano Frutos Fernando Tohmé, Fernando Delbianco and Fabio Miguel PDF (685K)
Abstract: We present here a hybrid algorithm for the Flexible Job-Shop Scheduling Problem (FJSSP). This problem involves the optimal use of resources in a flexible production environment in which each operation can be carried out by more than a single machine. Our algorithm allocates, in a first step, the machines to operations and in a second stage it sequences them by integrating a Multi-Objective Evolutionary Algorithm (MOEA) and a path-dependent search algorithm (Multi-Objective Simulated Annealing), which is enacted at the genetic phase of the procedure. The joint interaction of those two components yields a very efficient procedure for solving the FJSSP. An important step in the development of the algorithm was the selection of the right MOEA. Candidates were tested on problems of low, medium and high complexity. Further analyses showed the relevance of the search algorithm in the hybrid structure. Finally, comparisons with other algorithms in the literature indicate that the performance of our alternative is good.
Keywords: Flexible job-shop scheduling problem, Optimization, Multi-objective hybrid Evolutionary algorithm, Production
A GRASP-based approach to the multi activity combined timetabling and crew scheduling problem considering a heterogeneous workforce
, Pages: 597-606
Diego Novoa, Camilo Olarte, David Barrera and Eliana María González-Neira PDF (685K)
Abstract: This paper tackles an extension to the Multi-activity Combined Timetabling and Crew Scheduling Problem (MCTCSP). The goal of the original problem is to schedule the minimum number of homogenous workers required, in order to visit a set of customers characterized by services needed against schedule availability. However, since in home services it is common to have specialized workers, a mathematical model considering a heterogeneous workforce is proposed. As a solution, a GRASP-based algorithm is designed. In order to test the metaheuristic performance, 110 instances from the literature are adapted to include categorical skills. In addition, another 10 instances are randomly generated to consider large problems. The results show that the proposed GRASP finds optimal solutions in 46% of the cases and saves 40–96% computational time.
Keywords: Workforce Scheduling, Multi-activity Combined Timetabling and Crew Scheduling Problem (MCTCSP), Heterogeneous workforce, Categorical Skills, GRASP
A genetic algorithm for preemptive scheduling of a single machine
, Pages: 607-614
Amir-Mohammad Golmohammadi, Hamid Bani-Asadi, Hamed Jafar Zanjani and Hamid Tikani PDF (685K)
Abstract: This paper presents a mathematical model for scheduling of a single machine when there are preemptions in jobs. The primary objective of the study is to minimize different objectives such as earliness, tardiness and work in process. The proposed mathematical problem is considered as NP-Hard and the optimal solution is available for small scale problems. Therefore, a genetic algorithm (GA) is developed to solve the problem for large-scale problems. The implementation of the proposed model is compared with GA for problems with up to 50 jobs using three methods of roulette wheel sampling, random sampling and competition sampling. The results have indicated that competition sampling has reached optimal solutions for small scale problems and it could obtain better near-optimal solutions in relatively lower running time compared with other sampling methods.
Keywords: Preemption, Single machine scheduling, Work in process, Genetic algorithm
A multi-objective location-inventory model for 3PL providers with sustainable considerations under uncertainty
, Pages: 615-634
R. Daghigh, M.S. Jabalameli, A. Bozorgi Amiri and M.S. Pishvaee PDF (685K)
Abstract: In recent years, logistics development is considered as an important aspect of any country’s development. Outsourcing logistics activities to third party logistics (3PL) providers is a common way to achieve logistics development. On the other hand, globalization and increasing customers’ concern about the environmental impact of activities as well as the appearance of the issue of social responsibility have led companies employ sustainable supply chain management, which considers economic, environmental and social benefits, simultaneously. This paper proposes a multi-objective model to design logistics network for 3PL providers by considering sustainable objectives under uncertainty. Objective functions include minimizing the total cost, minimizing greenhouse gas emission and maximizing social responsibility subject to fair access to products, number of created job opportunities and local community development. It is worth mentioning that in the present paper the perishability of products is also considered. A numerical example is provided to solve and validate model using augmented Epsilon-Constraint method. The results show that three sustainable objectives were in conflict and as the one receives more desirable values, the others fall into more undesirable values. In addition, by increasing maximum perishable time periods and by considering lateral transshipment among facilities of a level one can improve sustainability indices of the problem, which indicates the necessity of such policy in improving network sustainability.
Keywords: Sustainable Development, Supply chain network design, Multi-objective optimization Possibilistic programming,
Locating distribution/service centers based on multi objective decision making using set covering and proximity to stock market
, Pages: 635-648
Mazyar Dabibi, Babak Farhang Moghaddam and Mohammad Ali Afshar Kazemi PDF (685K)
Abstract: In the present competitive world, facility location is an important aspect of the supply chain (sc) optimization. It involves selecting specific locations for facility construction and allocation of the distribution channel among different SC levels. In fact, it is a strategic issue which directly affects many operational/tactical decisions. Besides the accessibility, which results in customer satisfaction, the present paper optimizes the establishment costs of a number of distribution channels by considering their proximity to the stock market of the goods they distribute, and proposes mathematical models for two objective functions using the set covering problem. Then, two objective functions are proposed into one through the ε-constraint method and solved by the metaheuristic Genetic Algorithm (GA). To test the resulted model, a smaller scale problem is solved. Results from running the algorithm with different ε-values show that, on average, a 10% increase in ε, which increases the value of the second objective function - distance covered by customers will cause a 2% decrease in the value of the first objective function including the costs of establishing distribution centers). The repeatability and solution convergence of the two-objective model presented by the GA are other results obtained in this study.
Keywords: Marketing mix, Set covering problem, GA, Customer satisfaction, Facility location, Multi objective Optimization
A novel robust chance constrained possibilistic programming model for disaster relief logistics under uncertainty
, Pages: 649-670
Maryam Rahafrooz and Mahdi Alinaghian PDF (685K)
Abstract: In this paper, a novel multi-objective robust possibilistic programming model is proposed, which simultaneously considers maximizing the distributive justice in relief distribution, minimizing the risk of relief distribution, and minimizing the total logistics costs. To effectively cope with the uncertainties of the after-disaster environment, the uncertain parameters of the proposed model are considered in the form of fuzzy trapezoidal numbers. The proposed model not only considers relief commodities priority and demand points priority in relief distribution, but also considers the difference between the pre-disaster and post-disaster supply abilities of the suppliers. In order to solve the proposed model, the LP-metric and the improved augmented ε-constraint methods are used. Second, a set of test problems are designed to evaluate the effectiveness of the proposed robust model against its equivalent deterministic form, which reveales the capabilities of the robust model. Finally, to illustrate the performance of the proposed robust model, a seismic region of northwestern Iran (East Azerbaijan) is selected as a case study to model its relief logistics in the face of future earthquakes. This investigation indicates the usefulness of the proposed model in the field of crisis.
Keywords: Disaster relief Logistics, Relief facility location, Uncertainty, Chance constrained possibilistic programming, Robust optimization, Multi-objective optimization
Heuristics for no-wait flow shop scheduling problem
, Pages: 671-680
Kewal Krishan Nailwal, Deepak Gupta and Kawal Jeet PDF (685K)
Abstract: No-wait flow shop scheduling refers to continuous flow of jobs through different machines. The job once started should have the continuous processing through the machines without wait. This situation occurs when there is a lack of an intermediate storage between the processing of jobs on two consecutive machines. The problem of no-wait with the objective of minimizing makespan in flow shop scheduling is NP-hard; therefore the heuristic algorithms are the key to solve the problem with optimal solution or to approach nearer to optimal solution in simple manner. The paper describes two heuristics, one constructive and an improvement heuristic algorithm obtained by modifying the constructive one for sequencing n-jobs through m-machines in a flow shop under no-wait constraint with the objective of minimizing makespan. The efficiency of the proposed heuristic algorithms is tested on 120 Taillard’s benchmark problems found in the literature against the NEH under no-wait and the MNEH heuristic for no-wait flow shop problem. The improvement heuristic outperforms all heuristics on the Taillard’s instances by improving the results of NEH by 27.85%, MNEH by 22.56% and that of the proposed constructive heuristic algorithm by 24.68%. To explain the computational process of the proposed algorithm, numerical illustrations are also given in the paper. Statistical tests of significance are done in order to draw the conclusions.
Keywords: Flow shop scheduling, Makespan, Heuristic, No-wait
A hybrid algorithm for unrelated parallel machines scheduling
, Pages: 681-702
Mohsen Shafiei Nikabadi and Reihaneh Naderi PDF (685K)
Abstract: In this paper, a new hybrid algorithm based on multi-objective genetic algorithm (MOGA) using simulated annealing (SA) is proposed for scheduling unrelated parallel machines with sequence-dependent setup times, varying due dates, ready times and precedence relations among jobs. Our objective is to minimize makespan (Maximum completion time of all machines), number of tardy jobs, total tardiness and total earliness at the same time which can be more advantageous in real environment than considering each of objectives separately. For obtaining an optimal solution, hybrid algorithm based on MOGA and SA has been proposed in order to gain both good global and local search abilities. Simulation results and four well-known multi-objective performance metrics, indicate that the proposed hybrid algorithm outperforms the genetic algorithm (GA) and SA in terms of each objective and significantly in minimizing the total cost of the weighted function.
Keywords: Scheduling, genetic algorithm, Simulated Annealing, Unrelated parallel machines, Analytic network process
Multi-item economic production quantity model for imperfect items with multiple production setups and rework under the effect of preservation technology and learning environment
, Pages: 703-716
Preeti Jawla and S. R. Singh PDF (685K)
Abstract: This study aims to investigate the multi-item inventory model in a production/rework system with multiple production setups. Rework can be depicted as the transformation of production rejects, failed, or non-conforming items into re-usable products of the same or lower quality during or after inspection. Rework is very valuable and profitable, especially if materials are limited in availability and also pricey. Moreover, rework can be a good contribution to a ‘green image environment’. In this paper, we establish a multi-item inventory model to determine the optimal inventory replenishment policy for the economic production quantity (EPQ) model for imperfect, deteriorating items with multiple productions and rework under inflation and learning environment. In inventory modelling, Inflation plays a very important role. In one cycle, production system produces items in n production setups and one rework setup, i.e. system follows (n, 1) policy. To reduce the deterioration of products preservation technology investment is also considered in this model. Holding cost is taken as time dependent. We develop expressions for the average profit per time unit, including procurement of input materials, costs for production, rework, deterioration cost and storage of serviceable and reworkable lots. Using those expressions, the proposed model is demonstrated numerically and the sensitivity analysis is also performed to study the behaviour of the model.
Keywords: Multi-item, Selling price dependent demand, Preservation, Variable holding cost, Volume flexibility, Learning, Rework, Inflation, Multiple production setups
® 2010-2015 GrowingScience.Com