Abstract
This research deals with a scheduling problem for two-stage flow line, where each stage of the line consists of non-identical parallel machines. We first present a mixed integer linear programming formulation for the problem, and using this formulation, we can easily find the optimal solutions for small-sized problems with any commercial optimization software. However, since the problem is NP-hard and the size of a real problem is large in general, two genetic algorithm based heuristics are proposed to solve the practical big-size problems in a reasonable computational time. And then, to assess the performances of the algorithms, we conduct some computational experiment, from which we found both the heuristic algorithms show very good performances.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call