Abstract
ABSTRACTThis research investigates the parallel-batching scheduling problems with a time-dependent learning effect where the job processing time is a decreasing function of its starting time. Both the single-machine and parallel-machine circumstances are considered, and the objective is to minimize the makespan. For the single parallel-batching machine scheduling problem, some structural properties and a heuristic algorithm are developed to solve it. Since the parallel-batching machines scheduling problem is NP-hard, a hybrid CS-JADE algorithm combining improved cuckoo search algorithm (CS) and self-adaptive differential evolution (DE) is proposed to solve this problem. The computational experiments indicate that the proposed hybrid algorithm performs well both in effectiveness and efficiency.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.