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 条
  • [1] A three-agent scheduling problem for minimizing the makespan on a single machine
    Lee, Wen-Chiung
    Wang, Jen-Ya
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 106 : 147 - 160
  • [2] A three-agent flow shop problem for minimizing the total completion time
    Lee, Wen-Chiung
    Wang, Jen-Ya
    2017 6TH IIAI INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS (IIAI-AAI), 2017, : 825 - 828
  • [3] A THREE-AGENT SCHEDULING PROBLEM FOR MINIMIZING THE FLOW TIME ON TWO MACHINES
    Lee, Wen-Chiung
    Wang, Jen-Ya
    RAIRO-OPERATIONS RESEARCH, 2020, 54 (02) : 307 - 323
  • [4] Minimizing total tardiness in an unrelated parallel-machine scheduling problem
    Shim, S-O
    Kim, Y-D
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (03) : 346 - 354
  • [5] Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
    Bouska, Michal
    Suchaa, Premysl
    Novak, Antonin
    Hanzalek, Zdenek
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (03) : 990 - 1006
  • [6] Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect
    Hu, Jinchang
    Jin, Mingzhou
    MATHEMATICAL PROGRAMMING COMPUTATION, 2025, 17 (01) : 141 - 171
  • [7] Minimizing total tardiness on a single machine with controllable processing times
    Tseng, Chao-Tang
    Liao, Ching-Jong
    Huang, Kuo-Ling
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) : 1852 - 1858
  • [8] Simple heuristic to minimize total tardiness in a single machine scheduling problem
    R. Panneerselvam
    The International Journal of Advanced Manufacturing Technology, 2006, 30 : 722 - 726
  • [9] A Cooperative Solver for Single Machine Total Weighted Tardiness Scheduling Problem
    Chaabane, Lamiche
    PROCEEDINGS OF 2017 FIRST INTERNATIONAL CONFERENCE ON EMBEDDED & DISTRIBUTED SYSTEMS (EDIS 2017), 2017, : 220 - 224
  • [10] A new decomposition approach for the single machine total tardiness scheduling problem
    Della Croce, F
    Tadei, R
    Baracco, P
    Grosso, A
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (10) : 1101 - 1106
12345