Abstract

This paper investigates a two-machine flowshop scheduling problem modeled from a real production context of a chemical factory that produces foam-related products. The operations are categorized as supportive items and regular jobs. Many different compositions of foam can be mixed at the foam blowing stage, and products are processed at the manufacturing stage. Each job on machine two cannot start until all of its supportive operations on machine one are finished. The problem is to determine a schedule whose total job completion time is minimum. We propose a branch and bound algorithm, a simple heuristic and a meta-heuristic ILS. Computational experiments are conducted to study the performances of the proposed algorithms.

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

Disclaimer: 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.