C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem.
Xuan He
Quan-Ke Pan
Liang Gao
Janis S. Neufeld
Published in:
Eur. J. Oper. Res. (2023)
Keyphrases
</>
scheduling problem
flowshop
np hard
computational complexity
makespan minimization
worst case
optimal solution
special case
single machine
minimizing makespan
tabu search
dynamic programming
branch and bound
combinatorial optimization
processing times
parallel machines
neural network