Optimisation framework and method for solving the serial dual-shop collaborative scheduling problem
针对串行多车间协同调度问题，从生产中抽象出混合流水车间与作业车间组成的串行双车间问题，构建析取图模型，提出四种优化框架并用禁忌搜索算法比较其效果。
Due to the production process or environment, most products need to go through multiple production workshops, from raw materials to finished products. For example, a large structural part must go through a blanking workshop and a machining workshop. However, the research on the serial multi-shop cooperative scheduling problem is insufficient. Different from the single shop scheduling problem, the multi-shop scheduling problem can be regarded as a scheduling problem composed of multiple sub-problems. Therefore, optimisation processes between subproblems may be the key to solving this kind of problem. This paper focuses on the optimisation framework for the serial multi-shop cooperative scheduling problem. A specific serial dual-shop collaborative scheduling problem is abstracted from the production, whose first and second shop is the hybrid flow shop and the job shop, respectively. A disjunctive graph model of this specific problem is constructed. After that, four different optimisation frameworks are proposed, and testing instances are designed to compare these frameworks. Under different optimisation frameworks, the same tabu search algorithm with an efficient neighbourhood structure is used to optimize this problem. Finally, the optimisation results of different frameworks are compared and the results of each optimisation framework are analyzed.