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 条
  • [21] Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
    Chen, Ren-Xia
    Li, Shi-Sheng
    Li, Wen-Jie
    ENGINEERING OPTIMIZATION, 2019, 51 (02) : 217 - 230
  • [22] Minimizing total completion time in a two-machine flow shop with deteriorating jobs
    Wang, Ji-Bo
    Ng, C. T. Daniel
    Cheng, T. C. E.
    Liu, Li-Li
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 180 (01) : 185 - 193
  • [23] Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time
    Cheng, Mingbao
    Tadikamalla, Pandu R.
    Shang, Jennifer
    Zhang, Bixi
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (05) : 709 - 719
  • [24] Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
    Kravchenko, SA
    DISCRETE APPLIED MATHEMATICS, 2000, 98 (03) : 209 - 217
  • [25] An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
    Hatem Hadda
    Najoua Dridi
    Sonia Hajri-Gabouj
    4OR, 2010, 8 : 87 - 99
  • [26] Two-machine flow-shop scheduling problem with weighted WIP costs
    Yang, J
    PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING (12TH), VOLS 1- 3, 2005, : 592 - 597
  • [27] An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
    Hadda, Hatem
    Dridi, Najoua
    Hajri-Gabouj, Sonia
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2010, 8 (01): : 87 - 99
  • [28] One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
    Baki, MF
    Vickson, RG
    OPTIMIZATION METHODS & SOFTWARE, 2004, 19 (02): : 165 - 178
  • [29] Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
    Yin, Yunqiang
    Cheng, T. C. E.
    Wang, Du-Juan
    Wu, Chin-Chia
    JOURNAL OF SCHEDULING, 2017, 20 (04) : 313 - 335
  • [30] Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays
    Mkadem, Mohamed Amine
    Moukrim, Aziz
    Serairi, Mehdi
    OPERATIONS RESEARCH PROCEEDINGS 2016, 2018, : 527 - 533
12345