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 条

[1] SINGLE-MACHINE SCHEDULING AND SELECTION TO MINIMIZE TOTAL FLOW TIME WITH MINIMUM NUMBER TARDY
KYPARISIS, J
DOULIGERIS, C
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1993, 44 (08) : 835 - 838
[2] Integer Batch Scheduling Problems for a Single-Machine to Minimize Total Actual Flow Time
Yusriski, Rinto
Astuti, Budi
Sukoyo
Samadhi, T. M. A. Ari
Halim, Abdul Hakim
2ND INTERNATIONAL MATERIALS, INDUSTRIAL, AND MANUFACTURING ENGINEERING CONFERENCE, MIMEC2015, 2015, 2 : 118 - 123
[3] Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
Wang, Ji-Bo
Wang, Ming-Zheng
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 492 - 497
[4] SINGLE-MACHINE SCHEDULING TO MINIMIZE TOTAL LATE WORK
POTTS, CN
VANWASSENHOVE, LN
OPERATIONS RESEARCH, 1992, 40 (03) : 586 - 595
[5] Robust scheduling on a single machine to minimize total flow time
Lu, Chung-Cheng
Lin, Shih-Wei
Ying, Kuo-Ching
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1682 - 1691
[6] Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
Lee, Wen-Chiung
Shiau, Yau-Ren
Chung, Yu-Hsiang
Ding, Lawson
SCIENTIFIC WORLD JOURNAL, 2014,
[7] SCHEDULING WITH RELEASE DATES ON A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
BELOUADAH, H
POSNER, ME
POTTS, CN
DISCRETE APPLIED MATHEMATICS, 1992, 36 (03) : 213 - 231
[8] New Results on Single-Machine Scheduling with Rejection to Minimize the Total Weighted Completion Time
Zhang, Liqi
Yu, Xue
Lu, Lingfa
FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2024, 49 (01) : 75 - 94
[9] APPROXIMATION ALGORITHMS FOR SCHEDULING A SINGLE-MACHINE TO MINIMIZE TOTAL LATE WORK
POTTS, CN
VANWASSENHOVE, LN
OPERATIONS RESEARCH LETTERS, 1992, 11 (05) : 261 - 266
[10] Single-machine scheduling with deadlines to minimize the total weighted late work
Chen, Rubing
Yuan, Jinjiang
Ng, C. T.
Cheng, T. C. E.
NAVAL RESEARCH LOGISTICS, 2019, 66 (07) : 582 - 595

← 1 2 3 4 5 →