期刊
COMPUTERS & OPERATIONS RESEARCH
卷 37, 期 10, 页码 1814-1821出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.01.014
关键词
Production scheduling; Assembly-type flowshop; Mixed integer linear programming; Genetic algorithm
类别
资金
- National Natural Science Foundation of China [70671081, 70728001]
This paper addresses the production scheduling problem in a multi-page invoice printing system. The system comprises three stages: the stencil preparation stage, the page printing stage and the invoice assembly stage. Since each page can be considered as a component and the invoice as the finished product, the production system for multi-page invoices can be treated as an assembly-type flowshop with parallel machines at the last two stages. Moreover, two types of sequence-dependent setup operations are considered at the second stage. The objective is to minimize the makespan for all the invoice orders. We first formulate this problem into a mixed-integer linear programming (MILP). Then a hybrid genetic algorithm (HGA) is proposed for solving it due to its NP-hardness. To evaluate the performance of the HGA heuristic, a lower bound for the makespan is developed. Numerical experiment indicates that our algorithm can solve the problem efficiently and effectively. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据