Abstract
The problem of minimising the overall completion time for the two-machine flow shop problem with unit execution time (UET) tasks and arbitrary time delays is known to be unary NP -hard. Two heuristic algorithms to solve this problem along with their worst-case analyses are presented. We also discuss computational experiments we conducted to study the average-case performance of these two heuristics using simulation and statistical sampling methods.
Sign-in/Register to access full text options 
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.
