Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/3894
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOzturk, Cemalettin-
dc.contributor.authorÖrnek, Mustafa Arslan-
dc.date.accessioned2023-06-16T15:04:38Z-
dc.date.available2023-06-16T15:04:38Z-
dc.date.issued2016-
dc.identifier.issn1072-4761-
dc.identifier.urihttps://hdl.handle.net/20.500.14365/3894-
dc.description.abstractManufacturing Resources Planning (MRPII) systems are unable to prevent capacity problems occurring on the shop floor because of the fixed lead time and backward scheduling logic. For this reason, a new breed of concepts called APS (Advanced Planning and Scheduling) systems emerged which include finite capacity planning at the shop floor level through constraint based planning. In this paper, we present a Constraint Programming (CP) model to show how optimization models could be used in this context. We also present a two phase heuristic to solve this complicated APS problem. While jobs are assigned to the best eligible machines to smooth the workload on the machines in the first phase, a constraint based scheduling heuristic schedules jobs once they are assigned to eligible machines in the second phase. We provide numerical tests and discuss the results for both the model and the heuristic. The concluding remarks and suggestions for future research are stated in the final section of the paper. © International Journal of Industrial Engineering.en_US
dc.language.isoenen_US
dc.publisherUniversity of Cincinnatien_US
dc.relation.ispartofInternational Journal of Industrial Engineering : Theory Applications and Practiceen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectAdvanced planning and schedulingen_US
dc.subjectConstraint programmingen_US
dc.subjectHeuristicsen_US
dc.subjectComputer programmingen_US
dc.subjectConstraint theoryen_US
dc.subjectFloorsen_US
dc.subjectJob shop schedulingen_US
dc.subjectOptimizationen_US
dc.subjectPhase shiftersen_US
dc.subjectSchedulingen_US
dc.subjectAdvanced planning and schedulingen_US
dc.subjectAdvanced planning and scheduling systemsen_US
dc.subjectBackward schedulingen_US
dc.subjectConstraint programmingen_US
dc.subjectConstraint-based schedulingen_US
dc.subjectHeuristicsen_US
dc.subjectManufacturing resourceen_US
dc.subjectOptimization modelsen_US
dc.subjectHeuristic methodsen_US
dc.titleOptimisation and constraint based heuristic methods for advanced planning and scheduling systemsen_US
dc.typeArticleen_US
dc.identifier.scopus2-s2.0-84962204193en_US
dc.authorscopusid35093153800-
dc.identifier.volume23en_US
dc.identifier.issue1en_US
dc.identifier.startpage26en_US
dc.identifier.endpage48en_US
dc.identifier.wosWOS:000373358500003en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ3-
item.grantfulltextreserved-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.cerifentitytypePublications-
crisitem.author.dept05.09. Industrial Engineering-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File SizeFormat 
2947.pdf
  Restricted Access
483.22 kBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

19
checked on Nov 20, 2024

WEB OF SCIENCETM
Citations

16
checked on Nov 20, 2024

Page view(s)

98
checked on Nov 18, 2024

Download(s)

10
checked on Nov 18, 2024

Google ScholarTM

Check





Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.