共 50 条
Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion
被引:2
|作者:
Janiak, A.
[1
]
Janiak, W.
[2
]
Kovalyov, M. Y.
[3
]
机构:
[1] Polish Acad Sci, Syst Res Inst, PL-01447 Warsaw, Poland
[2] Int Univ Logist & Transport Wroclaw, PL-51168 Wroclaw, Poland
[3] Natl Acad Sci Belarus, United Inst Informat Problems, Minsk, BELARUS
关键词:
fully polynomial time approximation scheme;
scheduling;
due window assignment;
D O I:
10.2478/bpasts-2014-0088
中图分类号:
T [工业技术];
学科分类号:
08 ;
摘要:
A fully polynomial time approximation scheme (FPTAS) with run time O(n(m)/epsilon(m-1)) is developed for a problem which combines common due window assignment and scheduling n jobs on m identical parallel machines. The problem criterion is bottleneck (min-max) such that the maximum cost, which includes job earliness, job tardiness and due window size costs, is minimized.
引用
收藏
页码:805 / 808
页数:4
相关论文