A new constructive heuristic for the flowshop scheduling problem |
| |
| Institution: | 1. Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Faculty of Economics and Management Sciences of Sfax, University of Sfax, Airport Road km 4, BP 1088, Sfax 3018, Tunisia;2. Emirates College of Technology, Abu Dhabi, United Arab Emirates;3. University of Lyon, F-42023 Saint Etienne, France;4. University of Saint Etienne, Jean Monnet, F-42000 Saint-Etienne, France;5. LASPI, IUT de Roanne, F-42334, France;1. Industrial Management, School of Engineering, University of Seville, Ave. Descubrimientos s/n, E41092 Seville, Spain;2. Compañía Industrial de Aplicaciones Térmicas SA, Córdoba, Spain |
| |
| Abstract: | This paper presents a simple constructive heuristic (HFC) for the flowshop makespan problem which is capable of producing non-permutation schedules when it deems it appropriate. HFC determines the order of any two jobs in the final schedule based on their order in all two-machine problems embedded in the problem. Computational experiments indicate that HFC performs as well as NEH which is the currently best available constructive heuristic on problems where a permutation schedule is expected to be optimal. However, HFC outperforms NEH on problems where a non-permutation schedule may be optimal. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
