Abstract
This study addresses the two-machine flowshop in which a batch processor is followed by a discrete processor. The batch machine processes a batch of jobs simultaneously and the discrete machine processes one job at a time. Each job has a certain size or capacity requirements. The capacity of the batch processor is limited. The objective is to minimize the makespan. This problem is shown to be nondeterministic polynomial time hard. A heuristic algorithm and a branch-and-bound algorithm are presented. Computational results show that the proposed heuristic algorithm works effectively compared to the optimal solution, with an overall average quality of 99.42%.
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 callMore From: The International Journal of Advanced Manufacturing Technology
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.
