Abstract
This study addresses the two-machine flow-shop scheduling problems in which both machines are versatile and thus alternative operations are possible. The performance measures are the mean flow time and makespan of jobs, respectively. The problem is formulated as two integer programming models and two heuristics are developed. Computational results are provided to demonstrate the efficiency of the models and the effectiveness of the heuristics. The integer programming technique is inefficient even for small problems. For the set of problems with known optimal solutions, the average percentage errors of heuristics H1 and H2 are within 10%, respectively. For the set of problems with unknown optimal solutions, the average percentage errors of heuristic H1 for solving the mean flow time is 20.09%, while the average percentage errors of heuristic H2 for solving the makespan is 20.84%.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
