可变公共交货期、最小拖期工件双准则的两机流水作业问题
On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
摘要:
考虑了一类特殊的NP-困难两机流水作业问题,其目标是同时确定最小公共交货期和最少误工工件数。在[S. S.潘沃卡角Koulamas,一个O(n^2)算法的可变共同交货期,最小迟到作业双标准两台机器流水车间问题与有序机器,欧洲运筹学杂志221(2012),7-13。当工件在第一台机器上的加工时间较小时,提出了二次型算法。在本文中,我们通过使用最近引入的改进的二叉树数据结构的有效实现,将算法的运行时间提高到O(nlog n)。
英文摘要:
We consider a special case of the ordinary NP-hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An O(n^2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, European Journal of Operational Research 221 (2012), 7-13.], the authors presented quadratic algorithm for the problem when each job has its smaller processing time on the first machine. In this note, we improve the running time of the algorithm to O(n log n) by efficient implementation using recently introduced modified binary tree data structure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。