Minimize makespan of permutation flowshop using pointer network.

Young In Cho So Hyun Nam Ki Young Cho Hee Chang Yoon Jong Hun Woo

Published in: J. Comput. Des. Eng. (2021)

Keyphrases

permutation flowshop
scheduling problem
data structure
network structure
peer to peer
np hard
upper bound
total flowtime