An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem

被引：11
|
作者：
Elalouf, Amir [1 ]
Levner, Eugene [2 ]
Tang, Huajun [3 ]
机构：
[1] Bar Ilan Univ, Ramat Gan, Israel
[2] Ashkelon Acad Coll, Ashqelon, Israel
[3] Macau Univ Sci & Technol, Macao, Peoples R China
来源：
JOURNAL OF SCHEDULING | 2013年 / 16卷 / 04期
关键词：
Just-in-time scheduling; Flow shop; Complexity; Pseudo-polynomial algorithm; FPTAS; RESTRICTED SHORTEST-PATH;
D O I：
10.1007/s10951-013-0320-6
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Recently, Shabtay and Bensoussan (2012) developed an original exact pseudo-polynomial algorithm and an efficient -approximation algorithm (FPTAS) for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem. The complexity of the FPTAS is (()log(/)), where is the number of jobs. In this note we suggest another pseudo-polynomial algorithm that can be converted to a new FPTAS which improves Shabtay-Bensoussan's complexity result and runs in time.
引用
收藏
页码：429 / 435
页数：7
相关论文
共 50 条
12345