.png){kind=icon}
返回
Approximation algorithms for bi-objective parallel-machine scheduling in green manufacturing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2022.108949.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider bi-objective parallel-machine scheduling in green manufacturing to minimize the makespan and total processing cost. Each machine has a different constant processing cost per unit time. For the objective of minimizing the makespan, given a total cost budget, we provide an approximation algorithm with a worst-case ratio of root 33+1/4 approximate to 1.686, which improves the previous bound of 2. For the objective of minimizing the total processing cost, subject to all the jobs must be completed before a given common deadline, we provide an approximation algorithm with a worst-case ratio of 2+r/3, where r is the ratio of the maximum to the minimum processing cost per unit time on a machine.
Keyword:
Green manufacturing
Parallel-machine scheduling
Approximation algorithm
Worst-case ratio
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Bi-criteria single-machine batch scheduling with machine on/off switching under time-of-use tariffs
PREAI
分享收藏Energy-efficient bi-objective single-machine scheduling with power-down mechanism具有掉电机制的高能效双目标单机调度
PREAI
分享收藏A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs.png)
APPLIED INTELLIGENCE
OAAI
APPLIED INTELLIGENCEIF3.5
OAAI分享收藏分享收藏
查看更多内容