A Multicriteria Simheuristic Approach for Solving a Stochastic Permutation Flow Shop Scheduling Problem

Abstract

This paper proposes a hybridized simheuristic approach that couples a greedy randomized adaptive search procedure (GRASP), a Monte Carlo simulation, a Pareto archived evolution strategy (PAES), and an analytic hierarchy process (AHP), in order to solve a multicriteria stochastic permutation flow shop problem with stochastic processing times and stochastic sequence-dependent setup times. For the decisional criteria, the proposed approach considers four objective functions, including two quantitative and two qualitative criteria. While the expected value and the standard deviation of the earliness/tardiness of jobs are included in the quantitative criteria to address a robust solution in a just-in-time environment, this approach also includes a qualitative assessment of the product and customer importance in order to appraise a weighted priority for each job. An experimental design was carried out in several study instances of the flow shop problem to test the effects of the processing times and sequence-dependent setup times, obtained through lognormal and uniform probability distributions with three levels of coefficients of variation, settled as 0.3, 0.4, and 0.5. The results show that both probability distributions and coefficients of variation have a significant effect on the four decision criteria selected. In addition, the analytical hierarchical process makes it possible to choose the best sequence exhibited by the Pareto frontier that adjusts more adequately to the decision-makers’ objectives.

A Sim-Learnheuristic for the Team Orienteering Problem: Applications to Unmanned Aerial Vehicles

“…On the other hand, learnheuristics employ machine learning algorithms to improve the quality of solutions over time. Gonzalez-Neira et al [13] proposed a hybrid simheuristic method to solve a complex multicriteria stochastic permutation flow shop problem. This method combines a greedy randomized adaptive search procedure, Monte Carlo simulations, a Pareto archived evolution strategy, and an analytic hierarchy process to handle stochastic processing times and sequence-dependent setup times.…”

Special Issue “Scheduling: Algorithms and Applications”

“…The second paper [5] studies a multi-criteria permutation flow-shop scheduling problem, where both the processing times and the setup times are of stochastic nature. The authors consider four optimization criteria, namely two quantitative and two qualitative criteria.…”

Analysis of a support method for offering delivery promises in environments managed by S-DBR system

“…Once the average demand was defined, it was divided by the daily available time to obtain the average resource processing times. To simulate variability in demand and internal resources, the lognormal probability distribution was chosen (Diglio et al, 2021;Gonzalez-Neira et al, 2021). Based on Hopp & Spearman (2011), two levels of coefficient of variation (CV) were established: high (CV=1.5) and low (CV=0.5).…”