混合整数规划求解多联票据印刷过程中的生产调度问题

多联票据的印刷过程包括排版、单联印刷和多联配页与装订三个过程。该过程是柔性的流水生产线与装配混合的生产系统。本文研究了该系统中的票据印刷生产调度问题，目标是最小化所有产品的最大完成时间（Makespan）。该问题到目前为止还没有人研究，本文首先建立了该问题的混合整数规划模型，然后提出了该模型的求解方法，并给出了该问题的下界。最后的量化示例和算例试验表明本文的模型是有效的。

Mixed Integer Programming Approach to Production Scheduling for Invoice Printing Process

This paper focuses on a production scheduling problem in a three stage multi-page invoice printing system operating on a make-to-order base. The objective of the problem is to minimize the makespan for all products. A mixed integer linear programming is presented for a hybrid flexible flowshop with assembly operations at the last stage. We propose a stepwise procedure to solve the MILP model and compute a lower bound for the problem. Numerical examples are provided and some computational results with the proposed approach are reported.