Abstract
In this paper, we develop a hybrid approach to solve a production scheduling problem of special type. The approach is based on a general decomposition scheme proposed in earlier studies and is extended by a constructive greedy heuristic for medium term scheduling and a genetic algorithm for solving the auxiliary subproblem on a set of critical (bottleneck) processing units. The experimental study on a large-scale data showed a significant improvement of the solution quality and the solving time comparing to the previously known results, and confirmed the suitability of the proposed approach for the real-life production scheduling.
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.
