Solving Fuzzy Job-Shop Scheduling Problems with a Multiobjective OptimizerReport as inadecuate




Solving Fuzzy Job-Shop Scheduling Problems with a Multiobjective Optimizer - Download this document for free, or read online. Document in PDF available to download.

* Corresponding author 1 DOLPHIN - Parallel Cooperative Multi-criteria Optimization LIFL - Laboratoire d-Informatique Fondamentale de Lille, Inria Lille - Nord Europe 2 LIFL - Laboratoire d-Informatique Fondamentale de Lille 3 A.I. Centre and Department of Computer Science 4 Department of Mathematics, Statistics and Computing

Abstract : In real-world manufacturing environments, it is common to face a job-shop scheduling problem JSP with uncertainty. Among different sources of uncertainty, processing times uncertainty is the most common. In this paper, we investigate the use of a multiobjective genetic algorithm to address JSPs with uncertain durations. Uncertain durations in a JSP are expressed by means of triangular fuzzy numbers TFNs. Instead of using expected values as in other work, we consider all vertices of the TFN representing the overall completion time. As a consequence, the proposed approach tries to obtain a schedule that optimizes the three component scheduling problems corresponding to the lowest, most probable, and largest durations all at the same time. In order to verify the quality of solutions found by the proposed approach, an experimental study was carried out across different benchmark instances. In all experiments, comparisons with previous approaches that are based on a single-objective genetic algorithm were also performed.

Keywords : job-shop scheduling fuzzy number uncertainty multiobjective optimization





Author: Thanh-Do Tran - Ramiro Varela - Inés González-Rodríguez - El-Ghazali Talbi -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents