2022
DOI: 10.1177/1063293x221120072
|View full text |Cite
|
Sign up to set email alerts
|

Game-relationship-based remanufacturing scheduling model with sequence-dependent setup times using improved discrete particle swarm optimization algorithm

Abstract: Remanufacturing has become a Frontier technology in sustainable manufacturing and enables end-of-life products to be restored to their new conditions. Although remanufacturing scheduling has been widely investigated, the relationship between remanufacturers and customers is rarely examined. Therefore, a new game-relationship-based remanufacturing scheduling model with sequence-dependent setup times is proposed herein. In the model, the relationship between the remanufacturer and customers is constructed as a n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 33 publications
0
1
0
Order By: Relevance
“…Taking all these considerations into account, this paper uses the particle swarm algorithm to solve the QP problem [32]. The biggest advantage of this type of algorithm is that it does not need to have a precise portrayal of the system model, completely using a heuristic algorithm 'trial and error' to find, and the amount of computation required is not large.…”
Section: Mpcmentioning
confidence: 99%
“…Taking all these considerations into account, this paper uses the particle swarm algorithm to solve the QP problem [32]. The biggest advantage of this type of algorithm is that it does not need to have a precise portrayal of the system model, completely using a heuristic algorithm 'trial and error' to find, and the amount of computation required is not large.…”
Section: Mpcmentioning
confidence: 99%
“…Finally, this paper uses the particle swarm algorithm to solve the QP problem [32] . The biggest advantage of this type of algorithm is that it does not need to have a precise portrayal of the system model, completely using heuristic algorithm ' trial and error ' to find, the amount of computation required is not large.…”
Section: A Db a Db L A B E = D A D + D L Dmentioning
confidence: 99%