Research Article
An Extended Flexible Job Shop Scheduling Model for Flight Deck Scheduling with Priority, Parallel Operations, and Sequence Flexibility
Algorithm 1
The local search algorithm.
Find a critical path in a scheduling | for to do | Get the alternative supporting group set of critical operation | for to do | Find the set of positions where can move into supporting group | for to do | if is the current supporting group processing and the condition (22) is satisfied | then | move operation into position , return the new scheduling; | end if | if is not the current supporting group processing and the condition (23) is satisfied then | move operation into position , return the new scheduling; | end if | end for | end for | end for |
|