Minimization of maximum lateness with equal processing times for single machine

被引：0

作者：

Lazarev, Alexander A. ^{[1
,2
,3
,4
]}

Arkhipov, Dmitry I. ^{[1
]}

机构：

[1] RAS, Inst Control Sci, Moscow 117901, Russia

[2] Moscow MV Lomonosov State Univ, Moscow, Russia

[3] Moscow Inst Phys & Technol, Dolgoprudnyi, Russia

[4] Natl Res Univ, Higher Sch Econ, Moscow, Russia

来源：

IFAC PAPERSONLINE | 2015年 / 48卷 / 03期

关键词：

scheduling; unit-time jobs; polynomial algorithms; dynamic programming;

D O I：

10.1016/j.ifacol.2015.06.182

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The following case of the classical NP-hard scheduling problem is considered. There is a set of jobs N with identical processing times p = const. All jobs have to be processed on a single machine. The objective function is minimization of maximum lateness. We analyze algorithms for the makespan problem, presented by Garey et al. (1981) and Simons (1978) and represent two polynomial algorithms to solve the problem and to construct the Pareto set with respect to criteria L-max and C-max. The complexity of presented algorithms equals O(Q center dot n log n) and O(n(2) log n), where 10(-Q) is the accuracy of the input-output parameters. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

引用

页码：806 / 809

页数：4