Abstract
Batch scheduling is prevalent in many industries such as burn-in operations in semiconductor manufacturing and heat treatment operations in metalworking. In this paper, we consider the problem of minimizing makespan on parallel batch processing machines in the presence of non-identical job sizes and arbitrary release times. Since the problem under study is strongly NP-hard (non-deterministic polynomial-time hard), we develop a number of efficient heuristics. In the proposed heuristics, several distance matrix based approaches are first developed to form batches and a scheduling technique is devised to assign the batches to parallel machines. The performance of the proposed heuristics is evaluated by comparing their results to a set of existing heuristic and meta-heuristic algorithms in the literature. The computational experiments show that the proposed heuristics are competitive with respect to solution quality. Moreover, the computational costs of the proposed heuristics are very little.
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.
