Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
Year of publication: |
2019
|
---|---|
Authors: | Wei, Hongjun ; Yuan, Jinjiang |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 1, p. 41-46
|
Subject: | Scheduling | Flow shop | Total weighted completion time | NP-hard | Approximation algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
A hybrid algorithm to solve the stochastic flow shop scheduling problems with machine break down
Marichelvam, M. K., (2019)
-
Ma, Ran, (2014)
-
Chen, Rubing, (2023)
- More ...
-
Chen, Rubing, (2024)
-
Single‐machine scheduling with deadlines to minimize the total weighted late work
Chen, Rubing, (2019)
-
Zhang, Yuan, (2020)
- More ...