A three-agent scheduling problem for minimizing the total tardiness on a single machine

被引：0
|
作者：
Lee, Wen-Chiung [1 ]
Wang, Jen-Ya [2 ]
机构：
[1] Feng Chia Univ, Dept Stat, Taichung, Taiwan
[2] Hungkuang Univ, Dept Comp Sci & Informat Management, Taichung, Taiwan
来源：
PROCEEDINGS 2016 5TH IIAI INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS IIAI-AAI 2016 | 2016年
关键词：
Two-agent scheduling; Due window; Total tardiness; Genetic algorithm; DUE-WINDOW ASSIGNMENT; 2-AGENT ORDER ACCEPTANCE; COMMON FLOW ALLOWANCE; RESOURCE-ALLOCATION; PROCESSING TIMES; ALGORITHMS; MULTIPLE; AGENTS; SUM;
D O I：
10.1109/IIAI-AAI.2016.40
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Two-agent scheduling problems have been widely studied for many years. However, in the real world, there might be many agents competing for limited resources. This study explores a three-agent scheduling problem. The objective is to minimize the total tardiness of jobs from agent 1 with the restriction that all the jobs from agent 2 must be completed within a common due window, and each job from agent 3 needs to be completed within its individual due window. A simple genetic algorithm is proposed to observe the properties of this problem. Computational results show that the proposed algorithm fits the three-agent scheduling problem well.
引用
收藏
页码：664 / 668
页数：5
相关论文
共 50 条
  • [11] Simple heuristic to minimize total tardiness in a single machine scheduling problem
    Panneerselvam, R.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 30 (7-8) : 722 - 726
  • [12] Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine
    Lee, Ju-Yong
    Kim, Yeong-Dae
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 114 : 22 - 30
  • [13] On the single machine total tardiness problem
    Tian, ZJ
    Ng, CT
    Cheng, TCE
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (03) : 843 - 846
  • [14] On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
    Vasquez, Oscar C.
    OPERATIONS RESEARCH LETTERS, 2014, 42 (05) : 343 - 347
  • [15] A note on a single machine scheduling problem with generalized total tardiness objective function
    Gafarov, Evgeny R.
    Lazarev, Alexander A.
    Werner, Frank
    INFORMATION PROCESSING LETTERS, 2012, 112 (03) : 72 - 76
  • [16] Distributionally robust single machine scheduling with the total tardiness criterion
    Niu, Shengsheng
    Song, Shiji
    Ding, Jian-Ya
    Zhang, Yuli
    Chiong, Raymond
    COMPUTERS & OPERATIONS RESEARCH, 2019, 101 : 13 - 28
  • [17] Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine
    A. A. Lazarev
    A. G. Kvaratskheliya
    E. R. Gafarov
    Doklady Mathematics, 2007, 75 : 130 - 133
  • [18] Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
    Goncalves, Tomas C.
    Valente, Jorge M. S.
    Schaller, Jeffrey E.
    COMPUTERS & OPERATIONS RESEARCH, 2016, 70 : 115 - 126
  • [19] Minimizing Total Earliness and Total Tardiness on Single Machine with Release Dates
    Oyetunji, E. O.
    Oluleye, A. E.
    INTERNATIONAL JOURNAL OF ENGINEERING RESEARCH IN AFRICA, 2011, 5 : 30 - 43
  • [20] Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem
    Ta, Quang Chieu
    Billaut, Jean-Charles
    Bouquard, Jean-Louis
    JOURNAL OF INTELLIGENT MANUFACTURING, 2018, 29 (03) : 617 - 628
12345