Cooperative Multiobjective Decision Support for the Paper Industry
Author
Abstract
Suggested Citation
DOI: 10.1287/inte.29.5.5
Download full text from publisher
References listed on IDEAS
- Jianzhong Du & Joseph Y.-T. Leung, 1990. "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 483-495, August.
- P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
- Panwalkar, S. S. & Smith, M. L. & Koulamas, C. P., 1993. "A heuristic for the single machine tardiness problem," European Journal of Operational Research, Elsevier, vol. 70(3), pages 304-310, November.
- Stadtler, Hartmut, 1990. "A one-dimensional cutting stock problem in the aluminium industry and its solution," European Journal of Operational Research, Elsevier, vol. 44(2), pages 209-223, January.
- P. C. Gilmore & R. E. Gomory, 1963. "A Linear Programming Approach to the Cutting Stock Problem---Part II," Operations Research, INFORMS, vol. 11(6), pages 863-888, December.
- Dyckhoff, Harald, 1990. "A typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 44(2), pages 145-159, January.
- Haessler, Robert W. & Sweeney, Paul E., 1991. "Cutting stock problems and solution procedures," European Journal of Operational Research, Elsevier, vol. 54(2), pages 141-150, September.
- Christos Koulamas, 1994. "The Total Tardiness Problem: Review and Extensions," Operations Research, INFORMS, vol. 42(6), pages 1025-1041, December.
- Goulimis, Constantine, 1990. "Optimal solutions for the cutting stock problem," European Journal of Operational Research, Elsevier, vol. 44(2), pages 197-208, January.
- Lee, Young Hoon & Pinedo, Michael, 1997. "Scheduling jobs on parallel machines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 100(3), pages 464-474, August.
- Wascher, Gerhard, 1990. "An LP-based approach to cutting stock problems with multiple objectives," European Journal of Operational Research, Elsevier, vol. 44(2), pages 175-184, January.
- Robert W. Haessler, 1988. "Selection and Design of Heuristic Procedures for Solving Roll Trim Problems," Management Science, INFORMS, vol. 34(12), pages 1460-1471, December.
- Robert W. Haessler, 1971. "A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem," Management Science, INFORMS, vol. 17(12), pages 793-802, August.
- Soeiro Ferreira, J. & Antonio Neves, M. & Fonseca e Castro, P., 1990. "A two-phase roll cutting problem," European Journal of Operational Research, Elsevier, vol. 44(2), pages 185-196, January.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Pinar Keskinocak & Frederick Wu & Richard Goodwin & Sesh Murthy & Rama Akkiraju & Santhosh Kumaran & Annap Derebail, 2002. "Scheduling Solutions for the Paper Industry," Operations Research, INFORMS, vol. 50(2), pages 249-259, April.
- Patrik Flisberg & Mikael Rönnqvist & Stefan Nilsson, 2009. "Billerud Optimizes Its Bleaching Process Using Online Optimization," Interfaces, INFORMS, vol. 39(2), pages 119-132, April.
- S Eom & E Kim, 2006. "A survey of decision support system applications (1995–2001)," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(11), pages 1264-1278, November.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Pinar Keskinocak & Frederick Wu & Richard Goodwin & Sesh Murthy & Rama Akkiraju & Santhosh Kumaran & Annap Derebail, 2002. "Scheduling Solutions for the Paper Industry," Operations Research, INFORMS, vol. 50(2), pages 249-259, April.
- Gradisar, Miro & Resinovic, Gortan & Kljajic, Miroljub, 1999. "A hybrid approach for optimization of one-dimensional cutting," European Journal of Operational Research, Elsevier, vol. 119(3), pages 719-728, December.
- Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
- Umetani, Shunji & Yagiura, Mutsunori & Ibaraki, Toshihide, 2003. "One-dimensional cutting stock problem to minimize the number of different patterns," European Journal of Operational Research, Elsevier, vol. 146(2), pages 388-402, April.
- Gradisar, Miro & Kljajic, Miroljub & Resinovic, Gortan & Jesenko, Joze, 1999. "A sequential heuristic procedure for one-dimensional cutting," European Journal of Operational Research, Elsevier, vol. 114(3), pages 557-568, May.
- Hajizadeh, Iman & Lee, Chi-Guhn, 2007. "Alternative configurations for cutting machines in a tube cutting mill," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1385-1396, December.
- Muter, İbrahim & Sezer, Zeynep, 2018. "Algorithms for the one-dimensional two-stage cutting stock problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 20-32.
- Hoto, Robinson & Arenales, Marcos & Maculan, Nelson, 2007. "The one dimensional Compartmentalised Knapsack Problem: A case study," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1183-1195, December.
- Chen, Chuen-Lung S. & Hart, Stephen M. & Tham, Wai Mui, 1996. "A simulated annealing heuristic for the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 93(3), pages 522-535, September.
- Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
- Cizman, Anton & Cernetic, Janko, 2004. "Improving competitiveness in veneers production by a simple-to-use DSS," European Journal of Operational Research, Elsevier, vol. 156(1), pages 241-260, July.
- B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
- Zak, Eugene J., 2002. "Modeling multistage cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 313-327, September.
- Jie Fang & Yunqing Rao & Qiang Luo & Jiatai Xu, 2023. "Solving One-Dimensional Cutting Stock Problems with the Deep Reinforcement Learning," Mathematics, MDPI, vol. 11(4), pages 1-16, February.
- Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
- Kallrath, Julia & Rebennack, Steffen & Kallrath, Josef & Kusche, Rüdiger, 2014. "Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges," European Journal of Operational Research, Elsevier, vol. 238(1), pages 374-389.
- Tao Wu & Kerem Akartunal? & Raf Jans & Zhe Liang, 2017. "Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 523-543, August.
- Holthaus, Oliver, 2002. "Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths," European Journal of Operational Research, Elsevier, vol. 141(2), pages 295-312, September.
- Keehoon Kwon & Doyeong Kim & Sunkuk Kim, 2021. "Cutting Waste Minimization of Rebar for Sustainable Structural Work: A Systematic Literature Review," Sustainability, MDPI, vol. 13(11), pages 1-21, May.
- Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
More about this item
Keywords
production/scheduling; planning; industries; paper;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:29:y:1999:i:5:p:5-30. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.