pith. sign in

arxiv: 1303.5457 · v2 · pith:LNQNHUUCnew · submitted 2013-03-21 · 🧮 math.OC · cs.SY· eess.SY

Explicit solution of a tropical optimization problem with application to project scheduling

classification 🧮 math.OC cs.SYeess.SY
keywords problemschedulingboundexplicitfunctiongeneraloptimizationsolution
0
0 comments X
read the original abstract

A new multidimensional optimization problem is considered in the tropical mathematics setting. The problem is to minimize a nonlinear function defined on a finite-dimensional semimodule over an idempotent semifield and given by a conjugate transposition operator. A special case of the problem, which arises in just-in-time scheduling, serves as a motivation for the study. To solve the general problem, we derive a sharp lower bound for the objective function and then find vectors that yield the bound. Under general conditions, an explicit solution is obtained in a compact vector form. This result is applied to provide new solutions for scheduling problems under consideration. To illustrate, numerical examples are also presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.