arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1311.2879cs.DSmath.CO
收藏

公共交货期问题:给定工件序列的精确多项式算法

Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence

Abhishek Awasthi, Jörg Lässig, Oliver Kramer

摘要:

本文研究了单机和平行机上工件的排序问题,其中工件的加工时间不同,但交货期相同。如果早于或晚于到期日处理作业,则每个作业都会受到惩罚。该问题的目标是找到工作分配的机器,工作的加工顺序和时间,他们被处理,这使得总的罚款最小化由于迟到或提前的工作。本文提出了精确多项式算法,用于优化给定的作业序列或单机和并行机的运行时间复杂度分别为$O(n \log n)$和$O(mn^2 \log n)$,其中$n$是作业数和$m$机器数。该算法以作业序列$(J_i, i=1,2,\dots,n)$为输入,将作业及其最佳完成时间分配给机器(对于$m>1$),以使该序列的总代价最小.我们证明了单机情况下的最优性和两者的运行时复杂性。阻碍,我们提出的基准实例的结果,并与以前的工作进行比较,单台和并行机的情况下,$200$的工作。

英文摘要:

This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later than the due date. The objective of the problem is to find the assignment of jobs to machines, the processing sequence of jobs and the time at which they are processed, which minimizes the total penalty incurred due to tardiness or earliness of the jobs. This work presents exact polynomial algorithms for optimizing a given job sequence or single and parallel machines with the run-time complexities of $O(n \log n)$ and $O(mn^2 \log n)$ respectively, where $n$ is the number of jobs and $m$ the number of machines. The algorithms take a sequence consisting of all the jobs $(J_i, i=1,2,\dots,n)$ as input and distribute the jobs to machines (for $m>1$) along with their best completion times so as to get the least possible total penalty for this sequence. We prove the optimality for the single machine case and the runtime complexities of both. Henceforth, we present the results for the benchmark instances and compare with previous work for single and parallel machine cases, up to $200$ jobs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑