Approximation algorithms for bi-objective parallel-machine scheduling in green manufacturing
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 al...
Saved in:
| Published in: | Computers & industrial engineering Vol. 176; p. 108949 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.02.2023
|
| Subjects: | |
| ISSN: | 0360-8352, 1879-0550 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!