首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Scheduling of corrugated paper production
Authors:Kazuki Matsumoto  Hiroyoshi Miwa  Toshihide Ibaraki
Institution:1. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Sakyo-ku, Kyoto 606-8501, Japan;2. Department of Informatics, School of Science and Technology, Kwansei Gakuin University, 2-1 Gakuen Sanda, Hyogo 669-1337, Japan
Abstract:Corrugated paper is produced by gluing three types of papers of the same breadth. Given a set of orders, we first assign each order to one of the standard breadths, and then sequence those assigned to each standard breadth so that they are continuously manufactured from the three rolls of the specified standard breadth equipped in the machine called corrugator. Here we are asked to achieve multi-goals of minimizing total length of roll papers, total loss of papers caused by the differences between standard breadths and real breadths of the orders, and the number of machine stops needed during production. We use integer programming to assign orders to standard breadths, and then develop a special purpose algorithm to sequence the orders assigned to each standard breadth. This is a first attempt to handle scheduling problems of the corrugator machine.
Keywords:Scheduling  Corrugated paper  Complexity  Contiguous set  Integer programming
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号