Abstract
Large-scale scheduling problems have remained difficult to solve despite the intense research in the area and many successful algorithms. In this paper, a new decomposition algorithm is presented which finds a good feasible solution even for large-scale problems in a reasonable time. In each iteration, a maximum allowed number of operations is first assigned to available units, then the algorithm alternates between a production quantity maximization step and a production time minimization step in each iteration. The performance of the “rolling operation” algorithm is illustrated using an industrial example.
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.
