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. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1016/j.ejor.2007.10.019 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Corrugated paper,Complexity,Contiguous set,Integer programming | Production manager,Ordered set,Mathematical optimization,Scheduling (computing),Multiobjective programming,Paper machine,Integer programming,Corrugated fiberboard,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
192 | 3 | 0377-2217 |
Citations | PageRank | References |
1 | 0.40 | 1 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kazuki Matsumoto | 1 | 15 | 1.51 |
Hiroyoshi Miwa | 2 | 111 | 30.03 |
Toshihide Ibaraki | 3 | 2593 | 385.64 |