Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 114633

An algorithm for corrugated paper cutting


Kalpić, Damir; Mornar, Vedran; Fertalj, Krešimir
An algorithm for corrugated paper cutting // Advances in Multimedia, Video and Signal Processing Systems / Mastorakis, Nikos ; Kluev, Vitaly (ur.).
Singapur : London : München : Ženeva : Tokyo : Hong Kong : Taipei : Peking : Šangaj : Tianjin : Chennai: WSEAS Press, 2002. str. 292-296


CROSBI ID: 114633 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
An algorithm for corrugated paper cutting

Autori
Kalpić, Damir ; Mornar, Vedran ; Fertalj, Krešimir

Vrsta, podvrsta i kategorija rada
Poglavlja u knjigama, znanstveni

Knjiga
Advances in Multimedia, Video and Signal Processing Systems

Urednik/ci
Mastorakis, Nikos ; Kluev, Vitaly

Izdavač
WSEAS Press

Grad
Singapur : London : München : Ženeva : Tokyo : Hong Kong : Taipei : Peking : Šangaj : Tianjin : Chennai

Godina
2002

Raspon stranica
292-296

ISBN
960-8052-72-6

Ključne riječi
Cutting stock problem, Linear programming, Integer programming, Production planning, Duality

Sažetak
An automated machine cuts the rolls of corrugated paper longitudinally and splits the paper stripe into multiple conveyors, where in each of them a different equidistant lateral cut can be applied. There is a choice of input rolls of infinite length but different widths. The market requirement for large series of different rectangle-shaped articles has to be met. Upper limits for the articles also exist. The minimum material consumption is the objective of optimisation. A recursive function to generate all the possible cutting schemas is written. It provides for formulation of a linear programming model. The minimisation of machine set-up costs cannot be practically solved by binary variables because of the prohibitive problem size. Instead, an iterative navigation around the achieved optimum solution, using the dual activity values is devised.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA


Projekti:
0036002

Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb

Profili:

Avatar Url Krešimir Fertalj (autor)

Avatar Url Vedran Mornar (autor)

Avatar Url Damir Kalpić (autor)


Citiraj ovu publikaciju:

Kalpić, Damir; Mornar, Vedran; Fertalj, Krešimir
An algorithm for corrugated paper cutting // Advances in Multimedia, Video and Signal Processing Systems / Mastorakis, Nikos ; Kluev, Vitaly (ur.).
Singapur : London : München : Ženeva : Tokyo : Hong Kong : Taipei : Peking : Šangaj : Tianjin : Chennai: WSEAS Press, 2002. str. 292-296
Kalpić, D., Mornar, V. & Fertalj, K. (2002) An algorithm for corrugated paper cutting. U: Mastorakis, N. & Kluev, V. (ur.) Advances in Multimedia, Video and Signal Processing Systems. Singapur : London : München : Ženeva : Tokyo : Hong Kong : Taipei : Peking : Šangaj : Tianjin : Chennai, WSEAS Press, str. 292-296.
@inbook{inbook, author = {Kalpi\'{c}, Damir and Mornar, Vedran and Fertalj, Kre\v{s}imir}, year = {2002}, pages = {292-296}, keywords = {Cutting stock problem, Linear programming, Integer programming, Production planning, Duality}, isbn = {960-8052-72-6}, title = {An algorithm for corrugated paper cutting}, keyword = {Cutting stock problem, Linear programming, Integer programming, Production planning, Duality}, publisher = {WSEAS Press}, publisherplace = {Singapur : London : M\"{u}nchen : \v{Z}eneva : Tokyo : Hong Kong : Taipei : Peking : \v{S}angaj : Tianjin : Chennai} }
@inbook{inbook, author = {Kalpi\'{c}, Damir and Mornar, Vedran and Fertalj, Kre\v{s}imir}, year = {2002}, pages = {292-296}, keywords = {Cutting stock problem, Linear programming, Integer programming, Production planning, Duality}, isbn = {960-8052-72-6}, title = {An algorithm for corrugated paper cutting}, keyword = {Cutting stock problem, Linear programming, Integer programming, Production planning, Duality}, publisher = {WSEAS Press}, publisherplace = {Singapur : London : M\"{u}nchen : \v{Z}eneva : Tokyo : Hong Kong : Taipei : Peking : \v{S}angaj : Tianjin : Chennai} }




Contrast
Increase Font
Decrease Font
Dyslexic Font