Heuristic algorithm for ready-mixed concrete plant scheduling with multiple mixers

- An integrated scheduling problem of a ready-mixed concrete plant with multiple mixers is proposed.
- Heuristics with conjoint-rules of production, mixers, trucks, and pumps are developed.
- Cases are differentiated by quantity of orders and discrete degree of construction sites.
- Performance of conjoint-rules in various types of cases is reported.

In this study, the problem of integration of ready-mixed concrete (RMC) production scheduling and truck and pump dispatching in an RMC plant with multiple mixers is focused upon. A time-space network model, which combines RMC production and vehicle dispatching, is proposed. A heuristic algorithm with eight sets of conjoint priority rules for production scheduling, truck and pump dispatching, and mixer scheduling is developed to solve the problem. Computational experiments are conducted on actual cases collected from an RMC company; these cases are classified into four types based on the quantity of orders from construction sites and the discrete degree of construction sites. The advantages and disadvantages of adopting various conjoint-rules in the various types of cases are determined. The experimental results demonstrate that this heuristic solution is capable of enabling managers of RMC plants to develop more suitable schedules in various types of practical cases.