1998
DOI: 10.1205/026387698525388
|View full text |Cite
|
Sign up to set email alerts
|

Some Efficient Formulations for the Simultaneous Solution of Trim-Loss and Scheduling Problems in the Paper-Converting Industry

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…Chen et al (1996) use simulated annealing to solve the one-dimensional CSP to address the general problem of trim-loss and scheduling. For applications in the paper industry see Haessler and Talbot (1983), Harjunkoski et al (1998), Westerlund and Isaksson (1998), Östermark (1999), Giannelos and Georgiadis (2001), Beraldi et al (2009)) and Deep et al (2009). These articles use mixed integer programming, genetic hybrid algorithm, hybrid particle swarm optimization or stochastic models to solve the particular problems investigated.…”
Section: Literature Review and Preparatory Workmentioning
confidence: 99%
“…Chen et al (1996) use simulated annealing to solve the one-dimensional CSP to address the general problem of trim-loss and scheduling. For applications in the paper industry see Haessler and Talbot (1983), Harjunkoski et al (1998), Westerlund and Isaksson (1998), Östermark (1999), Giannelos and Georgiadis (2001), Beraldi et al (2009)) and Deep et al (2009). These articles use mixed integer programming, genetic hybrid algorithm, hybrid particle swarm optimization or stochastic models to solve the particular problems investigated.…”
Section: Literature Review and Preparatory Workmentioning
confidence: 99%
“…The author evaluate solution approaches from literature and also makes some new proposals. Westerlund and Isaksson (1998) model two-dimensional cutting stock problems for the converting industry. The model is formulated as nonlinear integer programming which can be written in an expanded linear form and be solved as a mixed integer linear programming.…”
Section: Production -Operational Planning Tasksmentioning
confidence: 99%
“…Puemsin et al (2012) and Ali et al (2013) provide solution approaches for twodimensional cutting stock problems. The setting is the same as in Westerlund and Isaksson (1998), i.e. solving the cutting stock problem for paper converting industry.…”
Section: Production -Operational Planning Tasksmentioning
confidence: 99%
“…A review work on different formulations of CSP and the different techniques to solve these is given in [10]. Instances of application of heuristic techniques for solving TLP can be found in [4,7,[14][15][16].…”
Section: Introductionmentioning
confidence: 99%