Abstract
ABSTRACT It is well known that most of the open shop scheduling problems are NP-hard. Currently, the open shop scheduling research has been focusing on minimizing makespan. In this study, we shall examine the total weighted tardiness open shop scheduling problem, which is also NP-hard. We present a heuristic solution method, based on iterative search strategy, for solving large-scaled problems. Experimental results indicate that the proposed heuristic method significantly outperforms other methods in literature. Also, we present an exact solution method, based on branch-and-bound, for solving small-scaled problems.
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 callSimilar Papers
More From: Journal of the Chinese Institute of Industrial Engineers
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.
