论文部分内容阅读
多联票据的印刷过程包括排版、单联印刷和多联配页与装订三个过程。该过程是柔性的流水生产线与装配混合的生产系统。本文研究了该系统中的票据印刷生产调度问题,目标是最小化所有产品的最大完成时间(M akespan)。该问题到目前为止还没有人研究,本文首先建立了该问题的混合整数规划模型,然后提出了该模型的求解方法,并给出了该问题的下界。最后的量化示例和算例试验表明本文的模型是有效的。
Multi-note printing process, including typesetting, single printing and multi-page with binding and binding of the three processes. The process is a flexible production line assembly and assembly of the production system. This paper investigates the issue of ticket printing production scheduling in this system, with the goal of minimizing the maximum completion time of all products (M akespan). This problem has not been studied yet. In this paper, we first establish a mixed integer programming model for the problem, and then propose a solution to the model, and give the lower bound of the problem. The final quantitative examples and case studies show that the model in this paper is valid.