OPTIMAL SETUP TIME REDUCTION FOR A SINGLE-PRODUCT WITH DYNAMIC DEMANDS

被引:9
作者
DIABY, M
机构
[1] College of Business, University of Connecticut, Storrs
关键词
SETUP TIME REDUCTION; DYNAMIC PROGRAMMING;
D O I
10.1016/0377-2217(94)00030-G
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the problem of reducing setup times for the dynamic lot-sizing problem. We explicitly consider setup times and setup reduction costs. A dynamic programming procedure is proposed for solving the problem. Explicit expressions are given for the two types of setup reduction cost functions that are commonly studied in the setup reduction literature (the logarithmic and the power cost functions). A numerical example is provided.
引用
收藏
页码:532 / 540
页数:9
相关论文
共 22 条