Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Optimization and Control

arXiv:2108.06425 (math)
[Submitted on 13 Aug 2021 (v1), last revised 22 Jan 2023 (this version, v3)]

Title:Minimizing maximum lateness in two-stage projects by tropical optimization

Authors:Nikolai Krivulin, Serge\uı Sergeev
View PDF
Abstract:We are considering a two-stage optimal scheduling problem, which involves two similar projects with the same starting times for workers and the same deadlines for tasks. It is required that the starting times for workers and deadlines for tasks should be optimal for the first-stage project and, under this condition, also for the second-stage project. Optimality is measured with respect to the maximal lateness (or maximal delay) of tasks, which has to be minimized. We represent this problem as a problem of tropical pseudoquadratic optimization and show how the existing methods of tropical optimization and tropical linear algebra yield a full and explicit solution for this problem.
Comments: 29 pages
Subjects: Optimization and Control (math.OC); Systems and Control (eess.SY)
MSC classes: 90C24 (Primary) 15A80, 90C47, 90B50, 90B35 (Secondary)
Cite as: arXiv:2108.06425 [math.OC]
  (or arXiv:2108.06425v3 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.2108.06425
Journal reference: Kybernetika 58(5), 816-841 (2022)
Related DOI: https://doi.org/10.14736/kyb-2022-5-0816

Submission history

From: Nikolai Krivulin [view email]
[v1] Fri, 13 Aug 2021 23:25:37 UTC (18 KB)
[v2] Sat, 3 Sep 2022 23:08:10 UTC (19 KB)
[v3] Sun, 22 Jan 2023 21:55:30 UTC (19 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2021-08
Change to browse by:
cs
cs.SY
eess
eess.SY
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)