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

An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance.

Jia-Yang MaoQuan-Ke PanZhong-Hua MiaoLiang Gao
Published in: Expert Syst. Appl. (2021)
Keyphrases