| Autor: |
Jen-Ya Wang |
| Jazyk: |
angličtina |
| Rok vydání: |
2019 |
| Předmět: |
|
| Zdroj: |
IEEE Access, Vol 7, Pp 172136-172151 (2019) |
| Druh dokumentu: |
article |
| ISSN: |
2169-3536 |
| DOI: |
10.1109/ACCESS.2019.2956551 |
| Popis: |
Scheduling on multiple machines has attracted considerable attention recently. However, most of traditional studies focused only on commercial cost and customer satisfaction. In fact, we are able to alleviate environmental damages via proper scheduling. This study explores a multi-machine scheduling problem with a due window. The objective is to minimize the total cost (including environmental cost). We develop a branch-and-bound algorithm (B&B) and two complementary lower bounds for optimally solving the problem when n |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
