NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
详细信息 查看全文
- 作者：Ayse Akbalik ; a ; ayse.akbalik@univ-lorraine.fr" class="auth_mail" title="E-mail the corresponding author ; Atidel B. Hadj-Alouaneb ; atidel.hadj@enit.rnu.tn" class="auth_mail" title="E-mail the corresponding author ; Nathalie Sauera ; nathalie.sauer@univ-lorraine.fr" class="auth_mail" title="E-mail the corresponding author ; Houcem Ghribia ; b
- 关键词：Inventory ; Lot sizing ; Capacity reservation contract ; Complexity ; Polynomial time algorithm
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：1 March 2017
- 年：2017
- 卷：257
- 期：2
- 页码：483-493
- 全文大小：1026 K
文摘
- •
Single-item lot sizing problem is studied under a capacity reservation contract.
- •
Batch deliveries are allowed and the overall replenishment cost is stepwise.
- •
Four NP-hard cases are identified and an efficient FPTAS is proposed.
- •
Pseudo-polynomial time dynamic programming algorithm is given for the general case.
- •
Polynomial time algorithms are proposed under restricted parameters.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |