Abstract
Algorithms are developed for finding an optimal or near-optimal permutation schedule for the static flowshop scheduling problem where set-up, processing, and removal times are separable. Computational experience with the proposed heuristic algorithms indicates that they are quite effective in minimizing the makespan for a given problem.
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.
