A Multiobjective Memetic Approach to Job-Shop Scheduling under Uncertainty

Abstract : In recent years, much work has been expended on addressing job-shop scheduling problems (JSP) with uncertain information. There are two primary approaches to uncertainty handling, i.e. using probability theory and possibility theory. In this work, we use the possibilistic approach to deal with JSP where uncertain processing times are modeled by triangular fuzzy numbers (TFNs). Algorithmically, this paper examines the incorporation of a local search into a multiobjective genetic approach. The incorporation results in a simple multiobjective memetic algorithm that is based on the NSGA-II and the N2 neighborhood structure for individual improvement in the Lamarckian learning procedure. An extensive experiment was conducted to con firm the superiority of the algorithm compared to both the single-objective memetic and multiobjective genetic methods.
Document type :
Conference papers
The 5th International Conference on Metaheuristics and Nature Inspired Computing (META'14), Oct 2014, Marrakech, Morocco. 2014, 〈http://meta2014.sciencesconf.org/〉
Liste complète des métadonnées

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-01110315
Contributor : Thanh-Do Tran <>
Submitted on : Tuesday, January 27, 2015 - 7:50:07 PM
Last modification on : Thursday, January 11, 2018 - 6:22:13 AM
Document(s) archivé(s) le : Friday, September 11, 2015 - 10:30:58 AM

File

meta14_tran.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01110315, version 1

Citation

Thanh-Do Tran, Inés González-Rodríguez, El-Ghazali Talbi. A Multiobjective Memetic Approach to Job-Shop Scheduling under Uncertainty. The 5th International Conference on Metaheuristics and Nature Inspired Computing (META'14), Oct 2014, Marrakech, Morocco. 2014, 〈http://meta2014.sciencesconf.org/〉. 〈hal-01110315〉

Share

Metrics

Record views

256

Files downloads

179