SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS ON K PARALLEL MACHINES

被引：38
|
作者：
ROOT, JG
机构：
来源：
MANAGEMENT SCIENCE | 1965年 / 11卷 / 03期
关键词：
D O I：
10.1287/mnsc.11.3.460
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：460 / 475
页数：16
相关论文
共 50 条
  • [21] SCHEDULING PARALLEL MACHINES ONLINE
    SHMOYS, DB
    WEIN, J
    WILLIAMSON, DP
    SIAM JOURNAL ON COMPUTING, 1995, 24 (06) : 1313 - 1331
  • [22] Approximating scheduling unrelated parallel machines in parallel
    Serna, M
    Xhafa, F
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2002, 21 (03) : 325 - 338
  • [23] Approximating Scheduling Unrelated Parallel Machines in Parallel
    Maria Serna
    Fatos Xhafa
    Computational Optimization and Applications, 2002, 21 : 325 - 338
  • [24] Scheduling jobs on unrelated parallel machines to minimize regular total cost functions
    Azizoglu, Meral
    Kirca, Omer
    IIE Transactions (Institute of Industrial Engineers), 1999, 31 (02): : 153 - 159
  • [25] Scheduling jobs on unrelated parallel machines to minimize regular total cost functions
    Azizoglu, M
    Kirca, O
    IIE TRANSACTIONS, 1999, 31 (02) : 153 - 159
  • [26] Real-time scheduling of parallel tasks with tight deadlines
    Jiang, Xu
    Guan, Nan
    Long, Xiang
    Tang, Yue
    He, Qingqiang
    JOURNAL OF SYSTEMS ARCHITECTURE, 2020, 108
  • [27] Optimal Joint Offloading and Wireless Scheduling for Parallel Computing with Deadlines
    Qin, Xudong
    Xu, Weijian
    Li, Bin
    17TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT 2019), 2019, : 330 - 337
  • [28] Scheduling parallel batching machines in a sequence
    Ward Passchyn
    Frits C. R. Spieksma
    Journal of Scheduling, 2019, 22 : 335 - 357
  • [29] HEURISTICS FOR SCHEDULING UNRELATED PARALLEL MACHINES
    HARIRI, AMA
    POTTS, CN
    COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (03) : 323 - 331
  • [30] Simultaneous lotsizing and scheduling on parallel machines
    Meyr, H
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (02) : 277 - 292
12345