Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
A solution procedure consisting of a genetic algorithm and dynamic programming is proposed to obtain a near-optimal solution for the eclectic model.
A solution procedure consisting of a genetic algorithm and dynamic programming is proposed to obtain a near-optimal solution for the eclectic model. Three kinds ...
Optimization of the stochastic dynamic production cycling problem by a genetic algorithm ; 巻: 30 ; 号: 12 ; 開始ページ: 1831 ; 終了ページ: 1849 ; 記述言語: 英語 ...
This paper studies the stochastic version of the dynamic, discrete period product cycling problem, in which several products are to be sequenced one at a ...
Masao Yokoyama, Harold W. Lewis III: Optimization of the stochastic dynamic production cycling problem by a genetic algorithm. Comput. Oper. Res.
$19.90
International Journal of Production Economics 60-61: 359-367 · Optimization of the stochastic dynamic production cycling problem by a genetic algorithm.
Lewis III, Optimization of the stochastic dynamic production cycling problem by a genetic algorithm, Computer & Operations Research, 30: 1831–1849, 2003.
People also ask
Mar 2, 2023 · Evolution is widely used in combinatorial optimization problems, where you're trying to determine the best order of a fixed number of elements.
Missing: cycling | Show results with:cycling
This paper presents alternative formulations of this problem. It uses a Lagrangean relaxation approach to decouple the problem and provide lower bounds.
Nov 18, 2012 · Yokoyama M, Lewis HW (2003) Optimization of the stochastic dynamic production cycling problem by a genetic algorithm. Comput Oper Res 30 ...