Collaborative Proposal: A Framework For Integrating Production Scheduling With Inventory Control

这个项目的重点是一个新的框架模型，具有调度功能，以及 库存功能。 所提出的框架包含一个大类的模型与一些新的模型之间已经建立良好的库存模型和调度模型。 新的模式似乎具有真实的实际意义。 一个模型通常假设许多不同的产品类型。每种产品类型都有一个给定的需求流，用于给定交货期的一些单位。 给定产品类型的每个单元必须在特定的到期日之前交付。 截止日期可能是定期或不定期的。生产给定类型的任何单元的时间是固定的。 每种产品都有提前成本和延迟成本。如果一台机器（或设施）被设置为生产一批（或一批）给定类型的产品，则产生设置成本。其目标是最小化所有的生产成本，包括提前成本，拖期成本和设置成本。 要考虑的机器（或设施）环境包括：（i）单机，（ii）并联机器，（iii）串联机器，（iv）柔性流水车间。 首先，重要的是要确定所提出的类中的哪些模型可以在多项式时间内解决，以及在多项式时间内可解决的问题和NP难问题之间的边界在哪里。其次，它是有趣的设计和测试算法的NP难的问题。 第三，我们打算将所发展的数学方法应用到真实的世界中 将由以下机构提供给我们的数据： 同事 工业上 拟议活动的知识价值是基于这样一个事实，即这些模型是对现有既定模型的有意义的概括， 似乎有有趣的新属性，允许多项式时间的解决方案。 多项式时间 算法以及NP-困难的情况下的算法预计会表现出有趣的新结构。 拟议活动的更广泛影响是基于这样一个事实，即研究团队与真正对模型和解决方案感兴趣的各种公司有着密切的联系。参与的公司包括Dash Optimization，项目团队与该公司有着非常密切的联系。 此外，将传播研究成果， 在主要研究者的各个机构举行的会议上;这些会议在过去通常是 参加的有学者和工业界人士。

This project focuses on a new framework of models that have scheduling features as well as inventory features. The framework proposed contains a large class of models with a number of new models lying in between already well established inventory models and scheduling models. The new models appear to be of real practical significance. A model typically assumes a number of different product types. Of each product type there is a given demand stream for a number of units with given delivery due dates. Each unit of a given product type must be delivered by a specific due date. The due dates may be regular or irregular. The time to produce any unit of a given type is fixed. Each product type has an earliness cost and atardiness cost. If a machine (or facility) is being set up to produce a run (or batch) of products of a given type a setup cost is incurred. The objective is to minimize all production costs including earliness costs, tardiness costs and setup costs. The machine (or facility) environments to be considered include: (i) the single machine, (ii) parallel machines, (iii) machines in series,(iv) flexible flow shops.The proposed work has various objectives. First, it is important to determine which models in the proposed class can be solved in polynomial time and where the borderline lies between the problems that are solvable in polynomial time and the problems that are NP-hard. Second, it is of interest to design and test heuristics for the problems that are NP-hard. Third, we intend to apply the heuristics developed to real world data that will be provided to us by colleagues in industry. The intellectual merit of the proposed activity is based on the fact that the models are meaningful generalizations of existing, well-established models and that a number of the new models appear to have interesting new properties that allow for polynomial time solutions. The polynomial time algorithms as well as the heuristics for the NP-hard cases are expected to exhibit interesting new structures. The broader impact of the proposed activity is based on the fact that the research team has strong ties with various companies that are genuinely interested in the models and in the solutions. The companies involved include Dash Optimization with which the project team has very close ties. Furthermore, the research will be disseminated at conferences to be held at the various institutions of the Principal Investigators; these conferences have, in the past, typically been attended by academicians as well as by people from industry.