摘要
This paper addresses the parallel flowshop scheduling problem with stochastic processing times, where a product composed of several components has to be finished at a particular moment. These components are processed in independent parallel factories, and each factory can be modeled as a permutation flowshop. The processing time of each operation at each factory is a random variable following a given probability distribution. The aim is to find the robust starting time of the operations at each factory in a way that all the components of the product are completed on a given deadline with a user-defined probability. A simheuristic algorithm is proposed in order to minimize each of the following key performance indicators: (i) the makespan in the deterministic version; and (ii) the expected makespan or a makespan percentile in the stochastic version. A set of computational experiments are carried out to illustrate the performance of the proposed methodology by comparing the outputs under different levels of stochasticity.
学科与关键词
- A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing timesMaria Gonzalez-Neira, Eliana; Ferone, Daniele; Hatami, Sara; Juan, Angel A.SIMULATION MODELLING PRACTICE AND THEORY, 2017, 79: 23-36.被引 102
- A simheuristic approach using the NSGA-II to solve a bi-objective stochastic flexible job shop problemRodriguez-Espinosa, Camilo Andres; Gonzalez-Neira, Eliana Maria; Zambrano-Rey, Gabriel MauricioJournal of Simulation, 2024, 18(4): 646-670.被引 4
- Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespanZhang, Guanghui; Xing, Keyi*; Cao, FengInternational Journal of Production Research, 2018, 56(9): 3226-3244.被引 54
