Joint Machine-Transporter Scheduling for Multistage Jobs with Adjustable Computation Time
Koresh Khateri, Giovanni Beltrame

TL;DR
This paper introduces a scalable, adjustable-time scheduling method for multi-stage jobs involving machine and transporter assignments, optimizing time and energy in multi-robot systems with NP-complete complexity.
Contribution
It proposes a novel integer linear programming approach with a sliding window for joint scheduling and assignment in multi-stage, multi-robot systems with adjustable computation time.
Findings
The method effectively schedules water sampling robots and transporters.
Trade-offs between optimality and computation time are demonstrated.
Application to real-world water sampling tasks shows practical viability.
Abstract
This paper presents a scalable solution with adjustable computation time for the joint problem of scheduling and assigning machines and transporters for missions that must be completed in a fixed order of operations across multiple stages. A battery-operated multi-robot system with a maximum travel range is employed as the transporter between stages and charging them is considered as an operation. Robots are assigned to a single job until its completion. Additionally, The operation completion time is assumed to be dependent on the machine and the type of operation, but independent of the job. This work aims to minimize a weighted multi-objective goal that includes both the required time and energy consumed by the transporters. This problem is a variation of the flexible flow shop with transports, that is proven to be NP-complete. To provide a solution, time is discretized, the solution…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Manufacturing and Logistics Optimization · Scheduling and Optimization Algorithms · Optimization and Search Problems
