曲阜师范大学学报(自然科学版)
麯阜師範大學學報(自然科學版)
곡부사범대학학보(자연과학판)
JOURNAL OF QUFU NORMAL UNIVERSITY (NATURAL SCIENCE EDITION)
2009年
3期
1-4
,共4页
串行批%双目标%动态规划%排序
串行批%雙目標%動態規劃%排序
천행비%쌍목표%동태규화%배서
serial-batch%bicriteria batching%dynamic programming%scheduling
考虑一类带机器安装时间的单机双目标串行分批排序问题.对这样两个问题1, s|s-batch, Bn, Cmaxu|∑Cj和1, s|s-batch, Bn, ∑Cjv|Cmax,通过动态规划给出了多项式时间最优算法.
攷慮一類帶機器安裝時間的單機雙目標串行分批排序問題.對這樣兩箇問題1, s|s-batch, Bn, Cmaxu|∑Cj和1, s|s-batch, Bn, ∑Cjv|Cmax,通過動態規劃給齣瞭多項式時間最優算法.
고필일류대궤기안장시간적단궤쌍목표천행분비배서문제.대저양량개문제1, s|s-batch, Bn, Cmaxu|∑Cj화1, s|s-batch, Bn, ∑Cjv|Cmax,통과동태규화급출료다항식시간최우산법.
In this paper, a kind of bicriteria model on a single serial-batching machine with machine setup times is considered. For the following two problems:1, s|s-batch, Bn, C maxu|∑Cj and 1, s|s-batch,Bn, ∑Cjv|Cmax, the optimal algorithms of polynomial dynamic programming is given.