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 条
  • [31] Efficient Method for Single Machine Total Tardiness Problem
    Minukhin, Sergii
    2012 IV INTERNATIONAL CONFERENCE PROBLEMS OF CYBERNETICS AND INFORMATICS (PCI), 2012,
  • [32] Deep Q-Networks for Minimizing Total Tardiness on a Single Machine
    Huang, Kuan Wei
    Lin, Bertrand M. T.
    MATHEMATICS, 2025, 13 (01)
  • [33] A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
    Cordone, Roberto
    Hosteins, Pierre
    COMPUTERS & OPERATIONS RESEARCH, 2019, 102 : 130 - 140
  • [34] An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem
    Chou, Fuh-Der
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) : 3857 - 3865
  • [35] A two-agent single-machine scheduling problem to minimize the total cost with release dates
    Wang, Du-Juan
    Yin, Yunqiang
    Wu, Wen-Hsiang
    Wu, Wen-Hung
    Wu, Chin-Chia
    Hsu, Peng-Hsiang
    SOFT COMPUTING, 2017, 21 (03) : 805 - 816
  • [36] On minimizing total tardiness in a serial batching problem
    Baptiste, P
    Jouglet, A
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 35 (01): : 107 - 115
  • [37] Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem
    Vahid Nasrollahi
    Ghasem Moslehi
    Mohammad Reisi-Nafchi
    Operational Research, 2022, 22 : 1403 - 1442
  • [38] Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem
    Nasrollahi, Vahid
    Moslehi, Ghasem
    Reisi-Nafchi, Mohammad
    OPERATIONAL RESEARCH, 2022, 22 (02) : 1403 - 1442
  • [39] Trajectory Scheduling Methods for minimizing total tardiness in a flowshop
    Li, Xiaoping
    Chen, Long
    Xu, Haiyan
    Gupta, Jatinder N. D.
    OPERATIONS RESEARCH PERSPECTIVES, 2015, 2 : 13 - 23
  • [40] A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness
    Chen, Lu
    Yang, Wenhui
    Qiu, Kejun
    Dauzere-Peres, Stephane
    COMPUTERS & OPERATIONS RESEARCH, 2023, 155
12345