论文标题
解决工业应用程序调度问题的分解策略
Decomposition Strategies for Solving Scheduling Problems in Industrial Applications
论文作者
论文摘要
本文概述了计算机科学/运营研究领域中关键优化问题的研究：工作店调度问题（JSP）。 JSP是一项具有挑战性的任务，必须使用一组稀缺的机器处理一组操作，以优化特定的目标。 JSP的主要目的是确定分配给每台计算机的过程的执行顺序以优化目标。我们对这项研究的主要兴趣是研究使用逻辑编程来解决JSP的开发分解策略。我们将目标分为两个主要阶段。第一阶段是应用分解方法，并通过解决一组已知基准实例来评估所提出的模型。第二阶段是应用从第一阶段获得的成功分解方法来解决现实生活中的调度问题。在当前状态下，我们完成了第一阶段，并开始了第二阶段，目的是拥有一个可以在短时间内提供工厂时间表的模型。
This article presents an overview of a research study of a crucial optimization problem in the Computer Science/Operations research field: The Job-shop Scheduling Problem (JSP). The JSP is a challenging task in which a set of operations must be processed using a set of scarce machines to optimize a particular objective. The main purpose of the JSP is to determine the execution order of the processes assigned to each machine to optimize an objective. Our main interest in this study is to investigate developing decomposition strategies using logic programming to solve the JSP. We split our goal into two main phases. The first phase is to apply the decomposition approach and evaluate the proposed model by solving a set of known benchmark instances. The second phase is to apply the successful decomposition methods obtained from the first phase to solve a scheduling problem in the real-life application. In the current state, we finished the first phase and started the second one aiming to have a model that can provide a schedule of a factory for a short-time period.
