A hybrid variable neighborhood search algorithm for limited-buffer permutation flow shop scheduling problem with makespan criterion

A hybrid variable neighborhood search algorithm for limited-buffer permutation flow shop scheduling problem with makespan criterion
-

doi
Article type
Journal
https://people.iut.ac.ir/en/moslehi/content/1621362