Abstract
This paper considers the problem of scheduling a group of jobs with arbitrary release times, non-identical sizes, and different processing times on non-identical parallel batch processing machines to minimize the total completion time. A mixed-integer programming (MIP) model is firstly constructed in this paper to solve this problem. Then since the studied problem is strongly NP-hard, a modified elite ant system algorithm with the local search (MEASL) is also proposed to solve it, which is compared with several meta-heuristic algorithms and the commercial optimization solver (Gurobi) through extensive simulation experiments. Finally, the experimental results verify the effectiveness of the proposed algorithm.
Published Version
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.
