当前位置: X-MOL 学术Arab. J. Sci. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Single-Machine Order Acceptance and Scheduling Problem Considering Setup Time and Release Date Relations
Arabian Journal for Science and Engineering ( IF 2.6 ) Pub Date : 2020-07-16 , DOI: 10.1007/s13369-020-04759-1
Papatya S. Bıçakcı , İmdat Kara , Müjgan Sağır

This paper focuses on a make-to-order production system, where rejection of some orders is inevitable due to limited production capacity. In such a system, accepting all orders may cause overloads, order delays, and customer dissatisfaction. For this reason, firms tend to reject some orders. The order acceptance and scheduling problem is defined as deciding simultaneously which orders to be selected and how to schedule these selected orders. An extension of this problem with sequence-dependent setup times and release dates has been rarely studied, and the existing studies suggest that setup activities wait for the release date to be performed. However, in real production environments this may not be the case. Therefore, this paper examines the relationships between setup times and release dates considering the overall scheduling literature. Previous scheduling studies define two different relationships concerning setup times and release dates. One of them considers setup time is completely dependent on release date, and the other one claims that they are completely independent. In this paper, a new relationship is addressed to propound that setup time may be partially dependent on the release date. The paper also proposes a new mixed integer linear programming formulation with O(n2) binary decision variables and O(n2) constraints. It includes a detailed computational analysis by solving available instances in the literature, which suggests that existing formulation can solve the test problems to optimality with up to 10 orders in a given time limit. Our proposed formulation, however, can solve the test problems to optimality with up to 50 orders within the same time limit. According to the findings, our approach seems to be more suitable for real-life applications, and the proposed formulation is extremely faster than the existing one.



中文翻译:

考虑建立时间和下达日期关系的单机订单接受和计划问题

本文着重于按订单生产系统,由于产能有限,不可避免地拒绝某些订单。在这样的系统中,接受所有订单可能会导致超载,订单延迟和客户不满。因此,企业倾向于拒绝某些订单。订单接受和计划问题定义为同时决定要选择哪些订单以及如何计划这些选择的订单。很少研究以序列依赖的安装时间和发布日期来扩展此问题,并且现有研究表明安装活动等待发布日期被执行。但是,在实际生产环境中可能并非如此。因此,本文考虑了整体调度文献,研究了设置时间和发布日期之间的关系。先前的调度研究定义了关于设置时间和发布日期的两种不同关系。他们中的一个认为安装时间完全取决于发行日期,而另一个则认为它们完全独立。在本文中,提出了一种新的关系以建议建立时间可能部分取决于发布日期。本文还提出了一种新的混合整数线性规划公式On 2)个二进制决策变量和On 2)约束。它包括通过解决文献中的可用实例进行的详细计算分析,这表明现有的公式可以在给定的时限内以多达10个数量级的方式将测试问题最优地解决。但是,我们提出的公式可以在同一时限内以多达50个订单解决测试问题,达到最佳状态。根据调查结果,我们的方法似乎更适合于现实生活中的应用,并且所提出的配方比现有方法要快得多。

更新日期:2020-07-16
down
wechat
bug