Multi-agent scheduling for shared manufacturing systems

Duran, Ege; Ozturk, Cemalettin; O’Sullivan, Barry

Multi-agent scheduling for shared manufacturing systems

cbnd

Files

1-s2.0-S1877050925001425-main.pdf(569.88 KB)

Published Version

Date

2025

Authors

Duran, Ege

Ozturk, Cemalettin

O’Sullivan, Barry

Publisher

Elsevier B.V.

Published Version

https://doi.org/10.1016/j.procs.2025.01.134

Abstract

Advances in digitization and resource-sharing business models have created new opportunities for manufacturing companies, enhancing competitiveness and resilience. However, these benefits bring computational challenges in efficiently planning and scheduling shared resources. Therefore, there is a need for scalable and quick solutions for practical applications. Shared manufacturing systems share characteristics with parallel machine scheduling, allowing for the application of advancements from this domain. This research focuses on Multi-Agent Parallel Machine Scheduling (MAPMS) in shared manufacturing, specifically addressing scenarios involving two parallel machines and distinct agents managing exclusive, set of non-overlapping orders. The study introduces a novel multi-objective mixed integer programming (MIP) model for order scheduling across multiple facilities, accounting for sequence-dependent setup times between orders. It also proposes a new heuristic method designed for industrial use. Benchmark instances demonstrate the practicality of both the MIP model and heuristic, contributing valuable insights into MAPMS challenges in shared manufacturing environments.

Keywords

Multiagent systems , Scheduling , Planning , Parallel machine

Citation

Duran, E., Ozturk, C. and O’Sullivan, B. (2025) ‘Multi-agent scheduling for shared manufacturing systems’, Procedia Computer Science, 253, pp. 727–736. https://doi.org/10.1016/j.procs.2025.01.134