We address the problem of scheduling jobs with non-identical sizes and distinct processing times on a single batch-processing machine, aiming at minimizing makespan. The extensive literature this NP-hard mostly focuses heuristics. Using an arc-flow based optimization approach, we construct novel formulation that represents it as determining flows in graphs. size increases machine capacity numbe...

This paper presents a hybrid algorithm for optimal scheduling of multipurpose batch process plants. The algortihm decomposes the scheduling problem into two parts: an aggregate scheduling stage, based on Mixed Integer Linear Programming (MILP), and a detailed scheduling stage, applying Constraint Logic Programming (CLP). This decomposition utilises the complementary strengths of the two solutio...