Near-Optimal Scheduling for LTL with Future Discounting
From MaRDI portal
(Redirected from Near-Optimal Scheduling for LTL with Future Discounting)
Abstract: We study the search problem for optimal schedulers for the linear temporal logic (LTL) with future discounting. The logic, introduced by Almagor, Boker and Kupferman, is a quantitative variant of LTL in which an event in the far future has only discounted contribution to a truth value (that is a real number in the unit interval [0, 1]). The precise problem we study---it naturally arises e.g. in search for a scheduler that recovers from an internal error state as soon as possible---is the following: given a Kripke frame, a formula and a number in [0, 1] called a margin, find a path of the Kripke frame that is optimal with respect to the formula up to the prescribed margin (a truly optimal path may not exist). We present an algorithm for the problem; it works even in the extended setting with propositional quality operators, a setting where (threshold) model-checking is known to be undecidable.
Recommendations
- Disruption management optimal scheduling for logistics distribution based on prospect theory
- Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs
- Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost
- Scheduling models and methods in optimal freight transportation planning
- scientific article; zbMATH DE number 1488160
- The finite horizon economic lot scheduling in flexible flow lines
- The discrete lot-sizing and scheduling problem
- Weighted LTL with discounting
- A dynamic programming framework for optimal delivery time slot pricing
- Heuristic strategies for a multi-allocation problem in LTL logistics
This page was built for publication: Near-Optimal Scheduling for LTL with Future Discounting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857795)
