Batch Scheduling Problem with Multiple Due-dates Constraints

被引:0
|
作者
Mohri, Shintaro [1 ]
Masuda, Teruo [2 ]
Hiroakilshii [3 ]
机构
[1] Kobegakuin Univ Kobe, Fac Econ, Kobe, Hyogo 6512180, Japan
[2] Tezukayama Univ Nara, Fac Business Adm, Nara 6318501, Japan
[3] KwanseiGakuin Univ Sanda, Fac Business Adm, Sanda 6628501, Japan
来源
关键词
Batch Scheduling; Dynamic Programming; Food Production;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper describes the issue of batch scheduling. In food production, the lead-time from produc-tion to sale should be decreased becausefreshness of the product is important. Products are shipped at diverse times depending on a demand of sellers, because the types of sellers has become diversified such as super-markets, convenience stores and etc. production of quantity demanded must be completed by time to ship it then. The authors consider a problem with due-dates constraints and construct the algorithm to find the opti-mal schedule that satisfy the due-dates constraint, batch size constraint, inventory time constraint and mini-mize total flow time.
引用
收藏
页码:1 / 6
页数:6
相关论文
共 50 条