Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/6413
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Akbalık, Ayşe | - |
dc.contributor.author | Penz, Bernard | - |
dc.date.accessioned | 2021-09-11T15:36:21Z | - |
dc.date.available | 2021-09-11T15:36:21Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.issn | 1366-588X | - |
dc.identifier.uri | https://doi.org/10.1080/00207543.2010.532921 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/6413 | - |
dc.description.abstract | In this article, a comparative discussion between just-in-time (JIT) and time window (TW) policies is performed for a special case of the single-item capacitated lot sizing problem (CLSP), in which two storage levels are available, including plant and customer levels. In the JIT policy, the customer demand has to be satisfied on the due date of the demand, however, in the TW policy, the shipment can be made a few days before the due date. The influence of the two policies on the total cost is studied for a structure of a single capacitated plant which replenishes a customer, both having storage spaces. Both planning problems are shown to be NP-hard using the well-known CLSP which constitutes their subpart. A mixed integer linear program and a pseudo-polynomial dynamic program are proposed for each policy. The objective of this article is first to solve the TW problem to the optimality and, second to show the gain obtained by TW policy in terms of cost reduction. For the benchmark, we used a large data set to see the influence of different parameters on the total cost. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Taylor & Francis Ltd | en_US |
dc.relation.ispartof | International Journal of Production Research | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | lot sizing | en_US |
dc.subject | delivery policies | en_US |
dc.subject | time window | en_US |
dc.subject | dynamic programming | en_US |
dc.subject | mixed integer linear programming | en_US |
dc.title | Comparison of just-in-time and time window delivery policies for a single-item capacitated lot sizing problem | en_US |
dc.type | Article | en_US |
dc.department | Faculties, Faculty of Engineering, Department of Industrial Engineering | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü | tr_TR |
dc.identifier.volume | 49 | en_US |
dc.identifier.issue | 9 | en_US |
dc.identifier.startpage | 2567 | en_US |
dc.identifier.endpage | 2585 | en_US |
dc.authorid | 0000-0002-2375-9349 | - |
dc.authorid | 0000-0002-2375-9349 | - |
dc.authorid | 0000-0003-0538-7112 | - |
dc.identifier.wos | WOS:000287494300008 | en_US |
dc.identifier.scopus | 2-s2.0-79951821726 | en_US |
dc.institutionauthor | Akbalık, Ayşe | - |
dc.identifier.doi | 10.1080/00207543.2010.532921 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q1 | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
item.openairetype | Article | - |
Appears in Collections: | Endüstri Mühendisliği Bölümü / Department of Industrial Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
14
checked on Sep 7, 2024
WEB OF SCIENCETM
Citations
9
checked on Aug 31, 2024
Page view(s)
40
checked on Sep 9, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.