MULTIDIMENSIONAL STOCK CUTTING PROBLEM AND A NEW SOLUTION APPROACH

dc.contributor.authorOkatan, Ali
dc.contributor.authorÖzkan, Durdu Mehmet
dc.contributor.authorBecerikli, Yaşar
dc.contributor.authorDemiray, H. Engin
dc.date.accessioned2020-11-21T15:55:30Z
dc.date.available2020-11-21T15:55:30Z
dc.date.issued2009en_US
dc.departmentİstanbul Ticaret Üniversitesien_US
dc.description.abstractIn this study linear programming and integer programming methods and their application areas are discussed, and these methods are implemented to stock cutting problem. In the application a new approach is used on solution of two dimensional stock cutting problem and performance of new method is compared to the other Methods. The aim of application is to obtain minimal leakage with fastest solution by using sizes, quantities of resource and target stocks, plotting the layout on screen.en_US
dc.identifier.endpage4439en_US
dc.identifier.issn1349-4198
dc.identifier.issn1349-418X
dc.identifier.issue12Aen_US
dc.identifier.startpage4431en_US
dc.identifier.urihttps://hdl.handle.net/11467/4009
dc.identifier.volume5en_US
dc.identifier.wosWOS:000272566800004en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherIcic Internationalen_US
dc.relation.ispartofInternational Journal of Innovative Computing Information and Controlen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectData stock cuttingen_US
dc.subjectLinear programmingen_US
dc.subjectInteger programmingen_US
dc.titleMULTIDIMENSIONAL STOCK CUTTING PROBLEM AND A NEW SOLUTION APPROACHen_US
dc.typeArticleen_US

Dosyalar