具有LIFO缓冲区的最优重调度作业
Optimally rescheduling jobs with a LIFO buffer
摘要：
本文考虑单机排序问题，其中一个给定的解决方案，即一个有序的一组工作，必须改善尽可能多的重新排序的工作。在不同的情况下，可能会出现重新计划的需求，例如，由于作业数据的变化，或者由于供应链\red{that is}的某个阶段中的本地目标与给定的序列不一致。常见的生产设置需要在输送机上移动工件（或零件）。这反映在我们的模型中，通过一个后进先出的政策访问的有限容量的缓冲区，促进重新排序的工作。我们考虑了经典的目标函数总加权完工时间，最大延迟和（加权）延迟的工件数，并研究其复杂性。对于其中的三个问题，我们提出了严格的多项式时间动态规划算法，而对于最小化延迟工件的加权数的情况下，NP-困难的证明，并给出了一个伪多项式算法。
英文摘要：
This paper considers single-machine scheduling problems in which a given solution, i.e. an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts, e.g. due to changes in the job data or because of the local objective in a stage of a supply chain \red{that is} not aligned with the given sequence. A common production setting entails the movement of jobs (or parts) on a conveyor. This is reflected in our model by facilitating the re-sequencing of jobs via a buffer of limited capacity accessible by a LIFO policy. We consider the classical objective functions of total weighted completion time, maximum lateness and (weighted) number of late jobs and study their complexity. For three of these problems we present strictly polynomial-time dynamic programming algorithms, while for the case of minimizing the weighted number of late jobs NP-hardness is proven and a pseudo-polynomial algorithm is given.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
