Autor: |
Hongyu He, Yanzhi Zhao, Xiaojun Ma, Yuan-Yuan Lu, Na Ren, Ji-Bo Wang |
Jazyk: |
angličtina |
Rok vydání: |
2023 |
Předmět: |
|
Zdroj: |
Mathematics, Vol 11, Iss 19, p 4135 (2023) |
Druh dokumentu: |
article |
ISSN: |
2227-7390 |
DOI: |
10.3390/math11194135 |
Popis: |
In this paper, we study a single-machine green scheduling problem with learning effects and past-sequence-dependent delivery times. The problem can be properly applied to tackle green manufacturing where production and delivery time are variable and highly subject to process-reengineering. Our goal is to determine the optimal sequence such that total weighted completion time and maximum tardiness are minimized. For the general case, we provide the analysis procedure of lower bound, and also propose the heuristic and branch-and-bound algorithms. Furthermore, computational experiments are conducted to demonstrate the effectiveness of our algorithms. |
Databáze: |
Directory of Open Access Journals |
Externí odkaz: |
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|