Tropical optimization problems in time-constrained project scheduling
N. Krivulin

TL;DR
This paper models complex project scheduling problems with various temporal constraints using tropical mathematics, providing new direct solutions that are practical for implementation and analysis.
Contribution
It introduces a novel tropical optimization framework for time-constrained project scheduling, deriving explicit solutions for multiple objective functions.
Findings
New direct solutions for project scheduling problems
Solutions are compact and suitable for practical use
Illustrated with simple numerical examples
Abstract
We consider a project that consists of activities to be performed in parallel under various temporal constraints, which include start-start, start-finish and finish-start precedence relationships, release times, deadlines, and due dates. Scheduling problems are formulated to find optimal schedules for the project with respect to different objective functions to be minimized, such as the project makespan, the maximum deviation from the due dates, the maximum flow-time, and the maximum deviation of finish times. We represent these problems as optimization problems in terms of tropical mathematics, and then solve them by applying direct solution methods of tropical optimization. As a result, new direct solutions of the scheduling problems are obtained in a compact vector form, which is ready for further analysis and practical implementation. The solutions are illustrated by simple…
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.
