A simheuristic approach using the NSGA-II to solve a bi-objective stochastic flexible job shop problem

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper addresses a bi-objective problem in flexible job shop scheduling (FJSS) with stochastic processing times. Following the Just-In-Time philosophy, the first objective is to minimise deterministic Earliness+Tardiness, and the second objective is to minimise the Earliness+Tardiness Risk. The second objective function seeks to obtain robust solutions under uncertain environments. The proposed approach is a simheuristic that hybridises the non-dominated sorting genetic algorithm (NSGA-II) with Monte Carlo simulation to obtain the Pareto frontier of both objectives. The computational results demonstrate the effectiveness of the proposed algorithm under different variability environments.

Cite

CITATION STYLE

APA

Rodríguez-Espinosa, C. A., González-Neira, E. M., & Zambrano-Rey, G. M. (2023). A simheuristic approach using the NSGA-II to solve a bi-objective stochastic flexible job shop problem. Journal of Simulation. https://doi.org/10.1080/17477778.2023.2231877

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free