Time variant lot sizing models for the warehouse scheduling problem
Time variant lot sizing models for the warehouse scheduling problem
复制标题
仓库调度问题的时变批量大小模型
DOI：
--
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
P. Jackson
中科院分区：
文献类型：
--
作者：
M. Hariga;P. Jackson
在需求量为常数、时间跨度为无穷大且无缺货的假设下，研究了n种产品进入仓库的调度问题.交货时间表是由一个周期性的时间变化的批量计划。阶次和阶次序列假设是给定的。我们制定了一个线性规划，确定相对于周期长度的交货时间，以尽量减少使用的相对最大空间，并表明最佳解决方案的特点是填补仓库在每个订单。我们绑定的最优解，通过使用最坏情况下的分析，并给出条件下，线性规划具有相同的最优解作为二次规划，最大限度地减少持有成本。在一般条件下，我们推导出一个约束的成本惩罚的结果时，使用的线性规划的最优解作为解决方案的二次规划。最后，我们完成了一个解决方案的非线性批量模型…
We consider the problem of scheduling the delivery of n products into a warehouse with limited space under the assumptions of continuous demands at constant rates, infinite horizon, and no backorders. The delivery schedule is described by a cyclic schedule with time-varying lot sizes. The order frequencies and the order sequence are assumed to be given. We formulate a linear program that determines delivery times relative to the cycle length to minimize the relative maximum space used and show that the optimal solution is characterized by filling the warehouse at each order. We bound the optimal solution by using a worst-case analysis and give conditions under which the linear program has the same optimal solution as a quadratic program that minimizes the holding cost. Under general conditions, we derive a bound on the cost penalty that results when using the optimal solution of the linear program as a solution to the quadratic program. Finally, we complete a solution to the nonlinear lot-sizing model by ...