Single-Machine Green Scheduling to Minimize Total Flow Time and Carbon Emission

被引：1
|
作者：
Zhang, Hong-Lin [1 ]
Qian, Bin [1 ]
Sun, Zai-Xing [1 ]
Hu, Rong [1 ]
Liu, Bo [2 ]
Guo, Ning [1 ]
机构：
[1] Kunming Univ Sci & Technol, Sch Informat Engn & Automat, Kunming 650500, Yunnan, Peoples R China
[2] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
来源：
INTELLIGENT COMPUTING THEORIES AND APPLICATION, PT I | 2018年 / 10954卷
基金：
美国国家科学基金会;
关键词：
Single-Machine Scheduling; Flow time; Carbon emission; Dynamic programming; Mathematical Programming; Bird Swarm Algorithm; BATCH DELIVERY; CONSUMPTION;
D O I：
10.1007/978-3-319-95930-6_67
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, single-machine scheduling with carbon emission index is studied. The objective function is to minimize the sum of total flow time and carbon emission. Firstly, the problem is shown to be NP-hard by Turing reduction. Then mathematical programming (MP) model is established. A pseudo-time algorithm based on dynamic programming (DPA) is proposed for small scale. And a Bird Swarm Algorithm (BSA) is proposed to compete with DPA. In addition, simulation experiments are used to compare the proposed algorithms. DPA is shown to be more efficient for small scale problem, and BSA is better for large scale problem.
引用
收藏
页码：670 / 678
页数：9
相关论文
共 50 条
  • [31] Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
    Rubing Chen
    Jinjiang Yuan
    Journal of Scheduling, 2019, 22 : 595 - 601
  • [32] Single-machine scheduling with multi-agents to minimize total weighted late work
    Shi-Sheng Li
    Jin-Jiang Yuan
    Journal of Scheduling, 2020, 23 : 497 - 512
  • [33] Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness
    Sun, XQ
    Noble, JS
    Klein, CM
    IIE TRANSACTIONS, 1999, 31 (02) : 113 - 124
  • [34] Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
    Chen, Rubing
    Yuan, Jinjiang
    JOURNAL OF SCHEDULING, 2019, 22 (05) : 595 - 601
  • [35] Single-machine scheduling with multi-agents to minimize total weighted late work
    Li, Shi-Sheng
    Yuan, Jin-Jiang
    JOURNAL OF SCHEDULING, 2020, 23 (04) : 497 - 512
  • [36] Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
    Sun, L-H
    Sun, L-Y
    Wang, J-B
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (04) : 768 - 775
  • [37] Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, J. J.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (02) : 320 - 331
  • [38] Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness
    Sun, Xiaoqing
    Noble, James S.
    Klein, Cerry M.
    IIE Transactions (Institute of Industrial Engineers), 1999, 31 (02): : 113 - 124
  • [39] Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
    Wan, Long
    Yuan, Jinjiang
    OPERATIONS RESEARCH LETTERS, 2013, 41 (04) : 363 - 365
  • [40] Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
    Byung-Cheon Choi
    Myoung-Ju Park
    Journal of Combinatorial Optimization, 2021, 41 : 781 - 793
12345