Publication:
Two dimensional guillotine cutting stock and scheduling problem in printing industry

dc.contributor.coauthorMostajabdaveh, Mahdi
dc.contributor.coauthorTahmasbi, Nadia
dc.contributor.departmentDepartment of Industrial Engineering
dc.contributor.kuauthorSalman, Fatma Sibel
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.date.accessioned2024-11-09T23:24:59Z
dc.date.issued2022
dc.description.abstractWe address a two-dimensional cutting stock problem combined with production scheduling that arises in paper printing industry where printing orders arrive daily, together with their specifications and desired delivery dates The planner has to decide the printing patterns, their quantities to be printed, and their production dates. The printing pattern should comply with guillotine cuts having three stages. The objective is to minimize the total printing cost composed of paper and plate costs. For plates containing orders with print on both sides, two printing options exist. With the printing options and the option of placing copies of orders in only one pattern, the problem differs from previous studies and becomes challenging to be solved by a mathematical model. We develop a nonlinear integer programming (NIP) model to obtain exact solutions for small-sized instances and an efficient Genetic Algorithm (GA) to solve real-sized problems. We design packing routines that generate balanced printing patterns by putting multiple copies of items in one pattern. The GA also takes advantage of complex heuristics for production scheduling and pattern reduction. We evaluate the performance of the GA against the NIP model. Computational experiments on large-sized real-world data demonstrate the efficiency of the GA.
dc.description.indexedbyWOS
dc.description.indexedbyScopus
dc.description.openaccessNO
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.volume148
dc.identifier.doi10.1016/j.cor.2022.106014
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.quartileQ2
dc.identifier.scopus2-s2.0-85137726922
dc.identifier.urihttps://doi.org/10.1016/j.cor.2022.106014
dc.identifier.urihttps://hdl.handle.net/20.500.14288/11289
dc.identifier.wos857219600004
dc.keywordsCutting stock
dc.keywordsPrinting industry
dc.keywordsPacking heuristics
dc.keywordsGenetic algorithm
dc.keywordsNonlinear integer Program
dc.keywordsBin-packing
dc.keywordsAlgorithms
dc.language.isoeng
dc.publisherPergamon-Elsevier Science Ltd
dc.relation.ispartofComputers & Operations Research
dc.subjectComputer Science
dc.subjectArtificial intelligence
dc.subjectIndustrial engineering
dc.subjectOperations research
dc.subjectManagement science
dc.titleTwo dimensional guillotine cutting stock and scheduling problem in printing industry
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.kuauthorSalman, Fatma Sibel
local.publication.orgunit1College of Engineering
local.publication.orgunit2Department of Industrial Engineering
relation.isOrgUnitOfPublicationd6d00f52-d22d-4653-99e7-863efcd47b4a
relation.isOrgUnitOfPublication.latestForDiscoveryd6d00f52-d22d-4653-99e7-863efcd47b4a
relation.isParentOrgUnitOfPublication8e756b23-2d4a-4ce8-b1b3-62c794a8c164
relation.isParentOrgUnitOfPublication.latestForDiscovery8e756b23-2d4a-4ce8-b1b3-62c794a8c164

Files