Suchergebnisse - Successive sublimation dynamic programming method

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

“… •We address the Temporal Knapsack Problem.•We propose a solution method based on Successive Sublimation Dynamic Programming algorithm …”
Volltext

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

“… Our algorithm is based on the Successive Sublimation Dynamic Programming (SSDP) method. Its major drawback is heavy memory usage to store dynamic programming states, although unnecessary states are eliminated in the course of the algorithm …”
Volltext

An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times von 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 …”
Volltext

An exact algorithm for the precedence-constrained single-machine scheduling problem von 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 …”
Volltext

A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time von 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 …”
Volltext

An efficient exact algorithm for general single-machine scheduling with machine idle time von 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 …”
Volltext

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

“… Our algorithm is based on the Successive Sublimation Dynamic Programming (SSDP) method. Its major drawback is heavy memory usage to store dynamic programming states, although unnecessary states are eliminated in the course of the algorithm …”
Volltext

Freeze drying process: real time model and optimization von Boss, Edinara Adelaide, Filho, Rubens Maciel, de Toledo, Eduardo Coselli Vasco

“… Freeze drying is a separation process based on the sublimation phenomenon. This process has the following advantages compared to the conventional drying process …”
Volltext