Scheduling with Rejection to Minimize the Total Weighted Completion Time

被引：0
|
作者：
Zhang, Shu-Xia [1 ]
Cao, Zhi-Gang [2 ]
Zhang, Yu-Zhong [3 ]
机构：
[1] Zhenjiang Watercraft Coll, Dept Watercraft Command, Zhenjiang 212003, Jiangsu, Peoples R China
[2] Chinese Acad Sci, Key Lab Management Decis & Informat Syst AMSS, Beijing 100190, Peoples R China
[3] Qufu Normal Univ, Coll Operat Res & Management Sci, Rizhao 276826, Shandong, Peoples R China
来源：
OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS | 2009年 / 10卷
基金：
中国国家自然科学基金;
关键词：
Scheduling; Rejection; Identical parallel machines; Approximation algorithm;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we address the scheduling problem with rejection in which we can choose a subset of jobs to process. Choosing not to process any job incurs a corresponding penalty. We consider the following problem for the first time: scheduling with rejection, to minimize the total weighted completion time with the constraint of total penalties on identical parallel machines, where the number of identical parallel machines is constant. We show that it is NP-hard and design a pseudo-polynomial time algorithm as well as an FPTAS through dynamic programming.
引用
收藏
页码：111 / +
页数：3
相关论文
共 50 条
  • [1] Online scheduling to minimize the total weighted completion time plus the rejection cost
    Ran Ma
    Jinjiang Yuan
    [J]. Journal of Combinatorial Optimization, 2017, 34 : 483 - 503
  • [2] Online scheduling to minimize the total weighted completion time plus the rejection cost
    Ma, Ran
    Yuan, Jinjiang
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 483 - 503
  • [3] Online Scheduling with Rejection to Minimize the Total Weighted Completion Time Plus the Total Rejection Cost on Parallel Machines
    Ma R.
    Yuan J.-J.
    [J]. Journal of the Operations Research Society of China, 2016, 4 (1) : 111 - 119
  • [4] New Results on Single-Machine Scheduling with Rejection to Minimize the Total Weighted Completion Time
    Zhang, Liqi
    Yu, Xue
    Lu, Lingfa
    [J]. FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2024, 49 (01) : 75 - 94
  • [5] A flowshop scheduling algorithm to minimize total weighted completion time
    Zhao, CL
    Zhang, QL
    Tang, HY
    [J]. PROCEEDINGS OF THE 4TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-4, 2002, : 1485 - 1488
  • [6] Customer order scheduling to minimize total weighted completion time
    Wang, Guoqing
    Cheng, T. C. Edwin
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2007, 35 (05): : 623 - 626
  • [7] Online scheduling of a single machine to minimize total weighted completion time
    Anderson, EJ
    Potts, CN
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2004, 29 (03) : 686 - 697
  • [8] Open shop scheduling problem to minimize total weighted completion time
    Bai, Danyu
    Zhang, Zhihai
    Zhang, Qiang
    Tang, Mengqian
    [J]. ENGINEERING OPTIMIZATION, 2017, 49 (01) : 98 - 112
  • [9] Scheduling a maintenance activity to minimize total weighted completion-time
    Mosheiov, Gur
    Sarig, Assaf
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 57 (04) : 619 - 623
  • [10] Scheduling start time dependent jobs to minimize the total weighted completion time
    Bachman, A
    Cheng, TCE
    Janiak, A
    Ng, CT
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (06) : 688 - 693
12345