search query: @indexterm PROBLEM FORMULATION / total: 70
reference: 10 / 70
| Author: | Framinan, J. M. Leisten, R. Ruiz-Usano, R. |
| Title: | Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation |
| Journal: | European Journal of Operational Research
2002 : SEP, VOL. 141:3, p. 559-569 |
| Index terms: | SCHEDULING SEQUENTIAL ANALYSIS HEURISTIC METHODS PROBLEM FORMULATION PROBLEM SOLVING |
| Language: | eng |
| Abstract: | In this paper the authors analyze the performance of flowshop sequencing heuristics with respect to the objectives of makespan and flowtime minimisation. For flowtime minimisation, the authors propose the strategy employed by the NEH heuristic to construct partial solutions. Results show that this approach outperforms the common fast heuristics for flowtime minimisation while performing similarly or slightly worse than others which, on reward, prove to be much more CPU time- consuming. Additionally, the suggested approach is well balanced with respect to makespan and flowtime minimisation. Based on the previous results, two algorithms are proposed for the sequencing problem with multiple objectives - makespan and flowtime minimisation. |
SCIMA