This is an implemention for some algorithms to solve a Permutation Flowshop Scheduling Problem (PFSP).
-
Updated
Jul 17, 2019 - Python
This is an implemention for some algorithms to solve a Permutation Flowshop Scheduling Problem (PFSP).
Solution to the PFSP problem (BIT北理工,最优化,置换流水车间调度)
Heuristic solver based on Ant Colony Optimization and designed for the Permutation Flow Shop Scheduling Problem with Weighted Tardiness (PFSP-WT)
应用模拟退火算法解决置换流水线车间调度问题,北理工最优化方法课程大作业,Applying Simulated Annealing Algorithm to Solve the Permutation Flow Shop Scheduling Problem
Add a description, image, and links to the pfsp topic page so that developers can more easily learn about it.
To associate your repository with the pfsp topic, visit your repo's landing page and select "manage topics."