.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Green manufacturing
Parallel-machine scheduling
Approximation algorithm
Worst-case ratio
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W