Abstract
We propose an experimental and theoretical analysis of heuristics solving the n-job two-machine flowshop problem with the total completion time criterion. We developed a heuristic and a lower bound and compare them with two well known heuristics from the literature and two classical lower bounds. Computational experiments and an analysis are given afterwards.
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.
