动态批量模型的最小预测水平程序

S. Chand, T. Morton
{"title":"动态批量模型的最小预测水平程序","authors":"S. Chand, T. Morton","doi":"10.1002/NAV.3800330110","DOIUrl":null,"url":null,"abstract":"This article presents new results which should be useful in finding production decisions while solving the dynamic lot sizing problem of Wagner–Whitin on a rolling horizon basis. In a rolling horizon environment, managers obtain decisions for the first period (or the first few periods) by looking at the forecasts for several periods. This article develops procedures to find optimal decisions for any specified number of initial periods (called planning horizon in the article) by using the forecast data for the minimum possible number of future periods. Computational results comparing these procedures with the other procedures reported in the literature are very encouraging.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"Minimal forecast horizon procedures for dynamic lot size models\",\"authors\":\"S. Chand, T. Morton\",\"doi\":\"10.1002/NAV.3800330110\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article presents new results which should be useful in finding production decisions while solving the dynamic lot sizing problem of Wagner–Whitin on a rolling horizon basis. In a rolling horizon environment, managers obtain decisions for the first period (or the first few periods) by looking at the forecasts for several periods. This article develops procedures to find optimal decisions for any specified number of initial periods (called planning horizon in the article) by using the forecast data for the minimum possible number of future periods. Computational results comparing these procedures with the other procedures reported in the literature are very encouraging.\",\"PeriodicalId\":431817,\"journal\":{\"name\":\"Naval Research Logistics Quarterly\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Naval Research Logistics Quarterly\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/NAV.3800330110\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics Quarterly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/NAV.3800330110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 60

摘要

本文提出了新的结果,这应该是有用的寻找生产决策,同时解决动态批量问题的瓦格纳-惠廷在滚动水平的基础上。在滚动视界环境中,管理人员通过查看几个时期的预测来获得第一个时期(或前几个时期)的决策。本文开发了一种程序,通过使用尽可能少的未来周期的预测数据,为任意指定数量的初始周期(在本文中称为规划范围)找到最佳决策。将这些程序与文献中报道的其他程序进行比较的计算结果是非常令人鼓舞的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Minimal forecast horizon procedures for dynamic lot size models
This article presents new results which should be useful in finding production decisions while solving the dynamic lot sizing problem of Wagner–Whitin on a rolling horizon basis. In a rolling horizon environment, managers obtain decisions for the first period (or the first few periods) by looking at the forecasts for several periods. This article develops procedures to find optimal decisions for any specified number of initial periods (called planning horizon in the article) by using the forecast data for the minimum possible number of future periods. Computational results comparing these procedures with the other procedures reported in the literature are very encouraging.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信