FLOW SHOP SCHEDULING DEVICE, FLOW SHOP SCHEDULING METHOD, AND STORAGE MEDIA FOR PROGRAM SOLVING FLOW SHOP SCHEDULING

摘要

PROBLEM TO BE SOLVED: To provide an excellent solution for a large scale flow shop scheduling problem at high speed. SOLUTION: When a schedule as a new solution is created in 6, pruning patterns where a work corresponding the contents of the longest critical blocks in the schedule are replaced by wild cards are generated in 7, and they are maintained as a pruning list in 8. When a neighborhood of the solution which are a set of new candidate solutions is generated by moving works corresponding to contents of respective critical blocks to outside in 3, new candidate solutions are examined if they match the patterns in the pruning list in 4. If a candidate matches, it will be excluded from the candidates to limit a search range.