• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times.

Jiang-Ping HuangQuan-Ke PanLiang Gao
Published in: Swarm Evol. Comput. (2020)
Keyphrases
  • dynamic programming
  • computational efficiency