The Selection of Optimal Flow Shop Scheduling with Resource Flexibility

The maximum potential power of flexible-resource and great improvements in the flow shop manufacturing efficiency can be achieved by the use of optimal scheduling. However,it will make the flexible-resource flow shop scheduling (FRFS) much more complex than usual. Based on the model for FRFS problem,this paper improves the current solution to by combining branch-and-bound algorithm with partan algorithm and by selecting the most optimal schedule.