A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan

A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan

0.00 Avg rating0 Votes
Article ID: iaor19992906
Country: Netherlands
Volume: 109
Issue: 2
Start Page Number: 321
End Page Number: 329
Publication Date: Sep 1998
Journal: European Journal of Operational Research
Authors: , ,
Keywords: heuristics
Abstract:

We treat a problem of scheduling n jobs on a three stages hybrid flowshop of particular structure (one machine in the first and third stages and two dedicated machines in stage two). The objective is to minimize the makespan. This problem is NP-complete. We propose two heuristic procedures to cope with realistic problems. Extensive experimentation with various problem sizes are conducted and the computational results show excellent performance of the proposed heuristics.

Reviews

Required fields are marked *. Your email address will not be published.