The Number of Setups ( Different Patterns ) in One-Dimensional Stock Cutting

@inproceedings{Belov2003TheNO,
  title={The Number of Setups ( Different Patterns ) in One-Dimensional Stock Cutting},
  author={Gleb Belov and Guntram Scheithauer},
  year={2003}
}
The primary objective in cutting and packing problems is tri m loss or material input minimization (in stock cutting) or value maxim ization (when packing into a knapsack). However, in real-life production we usually have many other objectives (costs) and constraints, for example , the number of different patterns. We propose a new simple model for setup m inimization (in fact, an extension of the Gilmore-Gomory model for trim l oss minimization) and develop a branch-and-price algorithm on its… CONTINUE READING
7 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Exact solution of cutting stock problems using column generation and branch - and - bound

  • Valério de Carvalho
  • International Transactions in Operational…
  • 1998

Solving one - dimensional cutting stock problems exactly with a cutting plane algorithm

  • J. Terno Scheithauer, A. Müller
  • European Journal of Operational Research
  • 1995

Linear programming for cutting problems

  • G. Scheithauer Nitsche

Similar Papers

Loading similar papers…