Skip to Main Content
This paper proposes a novel differential evolution algorithm approach to minimize makespan for a single batch-processing machine with non-identical job sizes. Batch processing machines can process all the jobs in a batch simultaneously. The processing times and the sizes of the jobs are known. The machine can process a batch as long as its capacity is not exceeded. The processing time of a batch is the longest processing time of all the jobs in that batch. According to the discrete characteristic of the problem, an iterative model with new operations is designed for the proposed algorithm. It is simple to implement and is suitable for discrete problems, especially for scheduling batch-processing machine problems with non-identical job sizes. The computational results show that the proposed algorithm is effective compare to the algorithms in the literature.