An effective L-MONG algorithm for solving multi-objective flow-shop inverse scheduling problems.
Jianhui MouXinyu LiLiang GaoWenchao YiPublished in: J. Intell. Manuf. (2018)
Keyphrases
- scheduling problem
- multi objective
- flowshop
- optimization algorithm
- np hard
- computational complexity
- single machine scheduling problem
- bicriteria
- processing times
- cost function
- strongly np hard
- sequence dependent setup times
- total weighted tardiness
- job shop scheduling
- job shop
- knapsack problem
- search algorithm for solving
- neural network
- single machine
- tabu search
- particle swarm optimization
- linear programming
- worst case
- dynamic programming
- artificial immune system
- maximum lateness
- open shop
- optimal solution