Search Results - Successive sublimation dynamic programming method
-
1
An iterative dynamic programming approach for the temporal knapsack problem
ISSN: 0377-2217, 1872-6860Published: Elsevier B.V 01.09.2021Published 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
An exact algorithm for single-machine scheduling without machine idle time
ISSN: 1094-6136, 1099-1425Published: Boston Springer Science and Business Media LLC 01.12.2009Published 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
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
ISSN: 0305-0548, 1873-765X, 0305-0548Published: Kidlington Elsevier Ltd 01.01.2013Published 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
An exact algorithm for the precedence-constrained single-machine scheduling problem
ISSN: 0377-2217, 1872-6860Published: Amsterdam Elsevier B.V 01.09.2013Published 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
A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
ISSN: 1094-6136, 1099-1425Published: Boston Springer US 01.06.2012Published 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
An efficient exact algorithm for general single-machine scheduling with machine idle time
ISBN: 9781424420223, 1424420229ISSN: 2161-8070Published: IEEE 01.08.2008Published in 2008 IEEE International Conference on Automation Science and Engineering (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
An exact algorithm for single-machine scheduling withoutmachine idle time
ISSN: 1094-6136Published: 01.12.2009Published 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
Freeze drying process: real time model and optimization
ISSN: 0255-2701, 1873-3204Published: Lausanne Elsevier B.V 01.12.2004Published 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

