Abstract

A decomposition and optimization algorithm is presented for large-scale job shop scheduling problems in which the total weighted tardiness must be minimized. In each iteration, a new subproblem is first defined by a heuristic approach and then solved using a genetic algorithm. We construct a fuzzy controller to calculate the characteristic values which describe the the bottleneck jobs in different optimization stages. Then, these characteristic values are used to guide the process of subproblem-solving in an immune mechanism. Numerical computational results show that the proposed algorithm is effective for solving large-scale scheduling 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 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.