A heuristic algorithm based on tabu search for the solution of flexible job shop scheduling problems with lot streaming
| Autor: | Eric Alfredo Rincón García, Antonin Ponsich, Román Anselmo Mora Gutiérrez, Miguel A. Fernández Romero |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Flexibility (engineering)
0209 industrial biotechnology Mathematical optimization 021103 operations research Optimization problem Job shop scheduling Computer science Heuristic Heuristic (computer science) 0211 other engineering and technologies 02 engineering and technology Solver Tabu search Set (abstract data type) 020901 industrial engineering & automation Metaheuristic |
| Zdroj: | GECCO |
| DOI: | 10.1145/3205455.3205534 |
| Popis: | The Job Shop Scheduling Problem (JSSP) has received a great attention from operation research and metaheuristic communities, because it constitutes a challenging optimization problem with many real-world applications. In this work, an extension of the simple JSSP operating mode is introduced, including flexibility (operations can be processed by several machines) and lot streaming (jobs may be divided into sublots). An integer programming model is developed in this study for tackling the resulting FJSSP-LS. This model was implemented within a a commercial solver, GUROBI and additionally, a Tabu Search (TS) algorithm is proposed as a solution technique. Compared over a set of 48 instances adapted for the FJSSP-LS working mode, the TS heuristic clearly outperforms the upper bounds found by GUROBI, which is never able to converge to optimality in a one hour time limit. Moreover, result analysis enables to provide some insights and draw some guidelines regarding the use of flexibility and lot streaming within JSSP. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|