A simulated annealing approach is proposed to minimize the makespan on a set of non-identical batch processingmachines arranged in parallel. The scheduling problem under study has the following characteristics: arbitrary jobsizes, arbitrary job processing times, and non-identical machine capacities. Each machine can process several jobssimultaneously as long as the machine capacity is not violated. The batch processing time is equal to the largestprocessing time among those jobs in the batch. The performance of the proposed solution approach is evaluated bysolving random problem instances and comparing the results to a solution approach reported in the literature. Theexperimental study indicates that the proposed solution approach outperforms the existing method.
展开▼
