A survey on offline scheduling with rejection
A survey on offline scheduling with rejection
复制标题
DOI：
10.1007/s10951-012-0303-z
复制
发表时间：
2013-02-01
影响因子：
2
通讯作者：
Kaspi, Moshe
中科院分区：
文献类型：
--
作者：
Shabtay, Dvir;Gaspar, Nufar;Kaspi, Moshe
在经典的确定性调度问题中，假设所有作业都必须被处理。然而，在许多实际情况下，主要是在高负荷的按订单生产系统中，接受所有的工作可能会导致订单完成的延迟，从而可能导致高库存和延迟成本。因此，在这样的系统中，公司可能希望通过外包或完全拒绝来拒绝某些工作的处理。拒绝调度领域通过将销售和生产决策分组到单个模型中，提供了协调销售和生产决策的方案。由于拒稿调度问题是一个非常有趣的问题，无论是从实践还是从理论的角度来看，它们都受到了研究人员的广泛关注。本调查的目的是通过对该领域的最新结果进行调查，为带拒绝的离线调度提供一个统一的框架。此外，我们还强调了拒绝调度与其他研究领域的密切联系，如加工时间可控调度和截止日期分配调度，并包括我们在开放问题上获得的一些新结果。
In classical deterministic scheduling problems, it is assumed that all jobs have to be processed. However, in many practical cases, mostly in highly loaded make-to-order production systems, accepting all jobs may cause a delay in the completion of orders which in turn may lead to high inventory and tardiness costs. Thus, in such systems, the firm may wish to reject the processing of some jobs by either outsourcing them or rejecting them altogether. The field of scheduling with rejection provides schemes for coordinated sales and production decisions by grouping them into a single model. Since scheduling problems with rejection are very interesting both from a practical and a theoretical point of view, they have received a great deal of attention from researchers over the last decade. The purpose of this survey is to offer a unified framework for offline scheduling with rejection by presenting an up-to-date survey of the results in this field. Moreover, we highlight the close connection between scheduling with rejection and other fields of research such as scheduling with controllable processing times and scheduling with due date assignment, and include some new results which we obtained for open problems.