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 条
  • [31] Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
    Yunqiang Yin
    T. C. E. Cheng
    Du-Juan Wang
    Chin-Chia Wu
    Journal of Scheduling, 2017, 20 : 313 - 335
  • [32] Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
    Cheng, Mingbao
    Tadikamalla, Pandu R.
    Shang, Jennifer
    Zhang, Shaqing
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 234 (03) : 650 - 657
  • [33] Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop
    Jafari, A. A.
    Zare, H. Khademi
    Lotfi, M. M.
    Tavakkoli-Moghaddam, R.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2016, 29 (06): : 778 - 787
  • [34] Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
    Al-Salem, Mohammed
    Bedoya-Valencia, Leonardo
    Rabadi, Ghaith
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2016, 2016
  • [35] The two-machine flow shop problem with conflict graphs
    Tellache, Nour El Houda
    Boudhar, Mourad
    IFAC PAPERSONLINE, 2016, 49 (12): : 1026 - 1031
  • [36] A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
    Ng, C. T.
    Wang, J. -B.
    Cheng, T. C. E.
    Liu, L. L.
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (01) : 83 - 90
  • [37] On the optimality conditions of the two-machine flow shop problem
    Hadda, Hatem
    Dridi, Najoua
    Hajji, Mohamed Karim
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 266 (02) : 426 - 435
  • [38] Two-machine flow shop scheduling problems with no-wait jobs
    Bouquard, JL
    Billaut, JC
    Kubzin, MA
    Strusevich, VA
    OPERATIONS RESEARCH LETTERS, 2005, 33 (03) : 255 - 262
  • [39] A branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release dates
    Ardakan, Mostafa Abouei
    Hakimian, Ali
    Rezvan, Mohammad Taghi
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2014, 27 (06) : 519 - 528
  • [40] On Rescheduling for Two-Machine Flow Shop System with the Arrival of New Jobs
    Yang J.
    Luo W.
    Luo, Wenchang (luowenchang@163.com), 2018, Taylor and Francis Ltd. (37) : 262 - 271
12345