Search Results - Successive sublimation dynamic programming method

  • Showing 1 - 8 results of 8
Refine Results
  1. 1

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

    ISSN: 0377-2217, 1872-6860
    Published: Elsevier B.V 01.09.2021
    Published in European journal of operational research (01.09.2021)
    “…•We address the Temporal Knapsack Problem.•We propose a solution method based on Successive Sublimation Dynamic Programming algorithm…”
    Get full text
    Journal Article
  2. 2

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

    ISSN: 1094-6136, 1099-1425
    Published: Boston Springer Science and Business Media LLC 01.12.2009
    Published in Journal of Scheduling (01.12.2009)
    “… 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…”
    Get full text
    Journal Article
  3. 3

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

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Published: Kidlington Elsevier Ltd 01.01.2013
    Published in Computers & operations research (01.01.2013)
    “… (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…”
    Get full text
    Journal Article
  4. 4

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

    ISSN: 0377-2217, 1872-6860
    Published: Amsterdam Elsevier B.V 01.09.2013
    Published in European journal of operational research (01.09.2013)
    “… (Successive Sublimation Dynamic Programming) method is employed.•Instances of the total weighted tardiness problem with up to 100 jobs are solved…”
    Get full text
    Journal Article
  5. 5

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

    ISSN: 1094-6136, 1099-1425
    Published: Boston Springer US 01.06.2012
    Published in Journal of scheduling (01.06.2012)
    “… (Successive Sublimation Dynamic Programming) method. We first extend our previous algorithm to the problem with machine idle time and next propose several improvements…”
    Get full text
    Journal Article
  6. 6

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

    ISBN: 9781424420223, 1424420229
    ISSN: 2161-8070
    Published: IEEE 01.08.2008
    “… (successive sublimation dynamic programming) method. In this algorithm a lower bound is computed by applying dynamic programming to a Lagrangian relaxation of the original…”
    Get full text
    Conference Proceeding
  7. 7

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

    ISSN: 1094-6136
    Published: 01.12.2009
    Published in Journal of scheduling (01.12.2009)
    “… 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…”
    Get full text
    Journal Article
  8. 8

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

    ISSN: 0255-2701, 1873-3204
    Published: Lausanne Elsevier B.V 01.12.2004
    Published in Chemical engineering and processing (01.12.2004)
    “…Freeze drying is a separation process based on the sublimation phenomenon. This process has the following advantages compared to the conventional drying process…”
    Get full text
    Journal Article