Please use this identifier to cite or link to this item: http://hdl.handle.net/11452/30170
Full metadata record
DC FieldValueLanguage
dc.date.accessioned2022-12-29T11:27:05Z-
dc.date.available2022-12-29T11:27:05Z-
dc.date.issued2015-01-20-
dc.identifier.citationİnkaya, T. ve Akansel, M. (2017). ''Coordinated scheduling of the transfer lots in an assembly-type supply chain: A genetic algorithm approach''. Journal of Intelligent Manufacturing, 28(4), 1005-1015.en_US
dc.identifier.issn0956-5515-
dc.identifier.urihttps://doi.org/10.1007/s10845-015-1041-9-
dc.identifier.urihttps://link.springer.com/article/10.1007/s10845-015-1041-9-
dc.identifier.uri1572-8145-
dc.identifier.urihttp://hdl.handle.net/11452/30170-
dc.description.abstractIn this study, we consider coordinated scheduling of the transfer lots in an assembly-type supply chain. An assembly-type supply chain consists of at least two stages, where the upstream stages manufacture the components for several products to be assembled at the downstream stages. In order to enable faster flow of products through the supply chain and to decrease the work-in-process inventory, the concept of lot streaming is used as a means of supply chain coordination. We introduce a mathematical model, which finds the optimal transfer lot sizes in the supply chain. The objective is the minimization of the sum of weighted flow and inventory costs. We develop genetic algorithm (GA) based heuristics to solve the proposed model efficiently. The experimental results show that the proposed GA-based approaches provide acceptable results in reasonable amount of time. We also show that coordination with lot streaming provides improvements in the supply chain performance.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectComputer scienceen_US
dc.subjectEngineeringen_US
dc.subjectAssembly-type supply chainen_US
dc.subjectGenetic algorithmen_US
dc.subjectLot streamingen_US
dc.subjectSupply chain coordinationen_US
dc.subjectManagementen_US
dc.subjectSystemsen_US
dc.subjectEnvironmenten_US
dc.subjectInventoryen_US
dc.subjectDeliveryen_US
dc.subjectNetworken_US
dc.subjectModelen_US
dc.subjectTimeen_US
dc.subjectAlgorithmsen_US
dc.subjectChainsen_US
dc.subjectGenetic algorithmsen_US
dc.subjectSchedulingen_US
dc.subjectStream flowen_US
dc.subjectSupply chainsen_US
dc.subjectAssemblyen_US
dc.subjectCoordinated schedulingen_US
dc.subjectGenetic algorithm approachen_US
dc.subjectInventory costsen_US
dc.subjectLot streamingen_US
dc.subjectOptimal transfersen_US
dc.subjectSupply chain coordinationen_US
dc.subjectSupply chain performanceen_US
dc.subjectWork in process inventoriesen_US
dc.titleCoordinated scheduling of the transfer lots in an assembly-type supply chain: A genetic algorithm approachen_US
dc.typeArticleen_US
dc.identifier.wos000396117700011tr_TR
dc.identifier.scopus2-s2.0-84921994859tr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergitr_TR
dc.contributor.departmentUludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü.tr_TR
dc.contributor.orcid0000-0002-4924-7587tr_TR
dc.contributor.orcid0000-0002-6260-0162tr_TR
dc.identifier.startpage1005tr_TR
dc.identifier.endpage1015tr_TR
dc.identifier.volume28tr_TR
dc.identifier.issue4tr_TR
dc.relation.journalJournal of Intelligent Manufacturingen_US
dc.contributor.buuauthorİnkaya, Tülin-
dc.contributor.buuauthorAkansel, Mehmet-
dc.contributor.researcheridAAH-2155-2021tr_TR
dc.contributor.researcheridABE-6702-2020tr_TR
dc.subject.wosComputer science, artificial intelligenceen_US
dc.subject.wosEngineering, manufacturingen_US
dc.indexed.wosSCIEen_US
dc.indexed.scopusScopusen_US
dc.indexed.pubmedPubMeden_US
dc.wos.quartileQ1tr_TR
dc.contributor.scopusid24490728300tr_TR
dc.contributor.scopusid55288514900tr_TR
dc.subject.scopusLot Streaming; Flexible; Flow Shop Schedulingen_US
Appears in Collections:Scopus
Web of Science

Files in This Item:
There are no files associated with this item.


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