Výsledky vyhľadávania - "Successive Sublimation Dynamic Programming method"

An iterative dynamic programming approach for the temporal knapsack problem Autor Clautiaux, F., Detienne, B., Guillot, G.

“…•We address the Temporal Knapsack Problem.•We propose a solution method based on Successive Sublimation Dynamic Programming algorithm.•Numerical experiments…”
Získať plný text

An exact algorithm for single-machine scheduling without machine idle time Autor Tanaka, Shunji, Fujikuma, Shuji, Araki, Mituhiko

“…This study proposes an exact algorithm for the general single-machine scheduling problem without machine idle time to minimize the total job completion cost…”
Získať plný text

An exact algorithm for the precedence-constrained single-machine scheduling problem Autor Tanaka, Shunji, Sato, Shun

“… (Successive Sublimation Dynamic Programming) method is employed.•Instances of the total weighted tardiness problem with up to 100 jobs are solved…”
Získať plný text

An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times Autor Tanaka, Shunji, Araki, Mituhiko

“… (Successive Sublimation Dynamic Programming) method. In the first stage of the algorithm, the conjugate subgradient algorithm or the column generation algorithm is applied to a Lagrangian relaxation of the original problem to adjust multipliers…”
Získať plný text

A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time Autor Tanaka, Shunji, Fujikuma, Shuji

“… (Successive Sublimation Dynamic Programming) method. We first extend our previous algorithm to the problem with machine idle time and next propose several improvements…”
Získať plný text

An efficient exact algorithm for general single-machine scheduling with machine idle time Autor Tanaka, S., Fujikuma, S.

“… (successive sublimation dynamic programming) method. In this algorithm a lower bound is computed by applying dynamic programming to a Lagrangian relaxation of the original…”
Získať plný text