J. B. G. Frenk

TL;DR: Several examples of one‐machine problems in which the minimization of expected cost subject to stochastic breakdowns of the machine can be successfully attacked analytically are provided.

TL;DR: In this article, an alternative optimal approach based on global optimisation theory is presented, which uses a dynamic Lipschitz constant and generates a solution in little time, and the running time of this procedure grows only linearly in the number of items.

TL;DR: A new dual problem for convex generalized fractional programs with no duality gap is presented and it is shown how this dual problem can be efficiently solved using a parametric approach using the Dinkelbach-type algorithm.

TL;DR: This work studies a greedy-type heuristic and refined it to obtain a new heuristic with a worst-case bound of 3/2 that is applicable to the 0-1 min-knapsack problem.

TL;DR: In this paper, the authors considered the problem of finding the set of actions that minimizes the expected (discounted) maintenance costs over both a finite horizon and an infinite horizon, and showed that the optimal maintenance decisions related to this problem are a solution of a continuous-time renewal-type dynamic programming equation.