*Transportation schedules, *Employees' workload, *Linear programming, *Production scheduling, *Mathematical programming, *Job shops, Gasoline blending

We study an integrated optimisation problem with blending, scheduling, and routing components for a melted material blending production system. The problem is formulated as a mixed-integer linear programming model that considers the blending machine environment, due dates, target amounts, required chemical compositions of the products, and ready times of the materials in containers. This model aimed to determine the container pairings, blending plants for container pairs, and schedules for blending operations while minimising the total end time of material usage, total penalty for violating component specifications, and employee workload. Further, we propose a three-stage approach that involves solving a relaxed problem and then resolving the problem with fixed variables. We developed a combinatorial Benders decomposition algorithm with a minimal infeasible subsystem identification algorithm for the blending scheduling problem. The experimental results indicate that the proposed method can find high-quality solutions within a reasonable amount of time. [ABSTRACT FROM AUTHOR]

Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)