Scheduling algorithm development for permutation flowshop under static and dynamic environment
Permutation flowshop scheduling problem (PFSP) is a classical combinatorial optimisation problem, which has attracted much attention from academia and industry in the last two decades. However, there are still great challenges to overcome. In existing heuristic methods, jobs with similar processing...
| Main Author: | |
|---|---|
| Published: |
Queen's University Belfast
2017
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.727425 |