CAJ | 학술논문

车间生产调度问题是最困难的约束组合优化问题。对于许多具有大型工件的加工车间而言，车间的调度问题除了一般的工件与机床的约束关系之外，还要受到例如行车、自动化小车( AGV )等公共资源的约束。由于通常行车数量受限，故大型工件的搬运除了考虑工序完工时间之外，还要考虑大型工件搬运路径、搬运时间等约束。文章根据企业实际生产中工序转换需要使用行车等公共资源的调度问题，提出了基于调度序列的公共设备规划优化设计方法，解决了使用行车的资源优化分配及其动态路径规划问题，实现总完工时间最短的目标，测试结果验证了算法的可行性。
차간생산조도문제시최곤난적약속조합우화문제。대우허다구유대형공건적가공차간이언，차간적조도문제제료일반적공건여궤상적약속관계지외，환요수도례여행차、자동화소차( AGV )등공공자원적약속。유우통상행차수량수한，고대형공건적반운제료고필공서완공시간지외，환요고필대형공건반운로경、반운시간등약속。문장근거기업실제생산중공서전환수요사용행차등공공자원적조도문제，제출료기우조도서렬적공공설비규화우화설계방법，해결료사용행차적자원우화분배급기동태로경규화문제，실현총완공시간최단적목표，측시결과험증료산법적가행성。
Production scheduling in a workshop is the most difficult issue for optimization of combined con-straints. In many workshops engaging the processing of large parts, the production scheduling is subjected to a number of constraints such as cranes, automated guiding vehicles ( AGV) and other public resources in ad-dition to general constraints of workpieces and machine tools. Due to limited quantity of cranes for handling of large workpieces we should consider the constraints on their handling path and time in addition to the time to complete the processes. Focusing on the scheduling issue on the demand of public resources like cranes during process switching in practical production, this article proposes an optimized approach for planning of public facilities based on scheduling sequence that can optimize the distribution of crane resources with dy-namic planning of handling path to achieve the goal of least time for job completion. The test result proves the feasibility of the algorithm.