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 条
  • [41] 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
  • [42] A GENERAL VARIABLE NEIGHBORHOOD SEARCH FOR SINGLE-MACHINE TOTAL TARDINESS SCHEDULING PROBLEM WITH STEP-DETERIORATING JOBS
    Guo, Peng
    Cheng, Wenming
    Wang, Yi
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2014, 10 (04) : 1071 - 1090
  • [43] Algorithms for single machine total tardiness scheduling with sequence dependent setups
    Gupta, Skylab R.
    Smith, Jeffrey S.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (02) : 722 - 739
  • [44] A new composite heuristic to minimize the total tardiness for the single machine scheduling problem with variable and flexible maintenance
    Costa, Antonio
    Corsini, Roberto Rosario
    Pagano, Daniele
    Fernandez-Viagas, Victor
    COMPUTERS & OPERATIONS RESEARCH, 2025, 173
  • [45] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
    Khoudi, Asmaa
    Berrichi, Ali
    OPERATIONAL RESEARCH, 2020, 20 (03) : 1763 - 1789
  • [46] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
    Asmaa Khoudi
    Ali Berrichi
    Operational Research, 2020, 20 : 1763 - 1789
  • [47] Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
    Valente, Jorge M. S.
    Schaller, Jeffrey E.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2223 - 2231
  • [48] Approximate solution methods for the parallel machine scheduling problem with total tardiness minimization
    Yalaoui, Farouk
    Bernate Lara, Andres F.
    Amodeo, Lionel
    Dugardin, Frederic
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 334 - 343
  • [49] Solving a two-agent single-machine learning scheduling problem
    Wu, Wen-Hung
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2014, 27 (01) : 20 - 35
  • [50] Parallel machine scheduling to minimize total tardiness
    Yalaoui, F
    Chu, CB
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2002, 76 (03) : 265 - 279
12345