EPTAS for parallel identical machine scheduling with time restrictions

被引:0
|
作者
Jaykrishnan, G. [1 ]
Levin, Asaf [1 ]
机构
[1] The Technion, Fac Ind Engn & Management, Haifa, Israel
基金
以色列科学基金会;
关键词
Scheduling; Approximation algorithms; Worst-case analysis; Makespan minimization; UNIFORM PROCESSORS; ALGORITHMS; NUMBER; BOUNDS;
D O I
10.1007/s10878-024-01108-y
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider the non-preemptive scheduling problem on identical machines where there is a parameter B and each machine in every unit length time interval can process up to B different jobs. The goal function we consider is the makespan minimization and we develop an EPTAS for this problem. Prior to our work a PTAS was known only for the case of one machine and constant values of B, and even the case of non-constant values of B on one machine was not known to admit a PTAS.
引用
收藏
页数:21
相关论文
共 50 条
  • [31] Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models
    Po-Chieng Hu
    The International Journal of Advanced Manufacturing Technology, 2005, 25 : 1046 - 1052
  • [32] Parallel machine scheduling with time constraints on machine qualifications
    Nattaf, Margaux
    Dauzere-Peres, Stephane
    Yugma, Claude
    Wu, Cheng-Hung
    COMPUTERS & OPERATIONS RESEARCH, 2019, 107 : 61 - 76
  • [33] Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints
    Zimmermann, J
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1999, 49 (02) : 221 - 238
  • [34] A tardiness-concerned constructive method for the identical parallel machine scheduling
    Xi, Yue
    Jang, Jaejin
    Friedman, Douglas C.
    Hou, Wanrong
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2015, 79 (5-8): : 851 - 862
  • [35] Discrete Harmony Search Algorithm for Identical Parallel Machine Scheduling Problem
    Chen Jing
    Liu Guang-Liang
    Lu Ran
    2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 5457 - 5461
  • [36] VNS-Based Heuristic for Identical Parallel Machine Scheduling Problem
    Bathrinath, S.
    Sankar, S. Saravana
    Ponnambalam, S. G.
    Leno, I. Jerin
    ARTIFICIAL INTELLIGENCE AND EVOLUTIONARY ALGORITHMS IN ENGINEERING SYSTEMS, VOL 1, 2015, 324 : 693 - 699
  • [37] A note on exact and heuristic algorithms for the identical parallel machine scheduling problem
    Dell'Amico, Mauro
    Iori, Manuel
    Martello, Silvano
    Monaci, Michele
    JOURNAL OF HEURISTICS, 2012, 18 (06) : 939 - 942
  • [38] A tardiness-concerned constructive method for the identical parallel machine scheduling
    Yue Xi
    Jaejin Jang
    Douglas C. Friedman
    Wanrong Hou
    The International Journal of Advanced Manufacturing Technology, 2015, 79 : 851 - 862
  • [39] Identical parallel machine scheduling problem with partial vertex cover constraint
    Guan, Li
    Liu, Hongli
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2024, 52 (11): : 72 - 77
  • [40] Bi-objective Optimization in Identical Parallel Machine Scheduling Problem
    Bathrinath, Sankaranarayanan
    Sankar, S. Saravana
    Ponnambalam, S. G.
    Kannan, B. K. V.
    SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, PT I (SEMCCO 2013), 2013, 8297 : 377 - 388