Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11779/764
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Taş, Duygu | - |
dc.date.accessioned | 2019-02-28T13:04:26Z | |
dc.date.accessioned | 2019-02-28T11:08:23Z | |
dc.date.available | 2019-02-28T13:04:26Z | |
dc.date.available | 2019-02-28T11:08:23Z | |
dc.date.issued | 2015 | - |
dc.identifier.citation | Tas, D. (November 2015). A Capacitated Lot Sizing Problem with Stochastic Setup Times, INFORMS Annual Meeting 2015, Philadelphia, USA, 1–4. | en_US |
dc.identifier.uri | https://hdl.handle.net/20.500.11779/764 | - |
dc.description | Duygu Taş (MEF Author) | en_US |
dc.description | ##nofulltext## | en_US |
dc.description.abstract | In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST). | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | INFORMS Annual Meeting | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.title | A Capacitated Lot Sizing Problem With Stochastic Setup Times | en_US |
dc.type | Conference Object | en_US |
dc.authorid | Duygu Taş / 0000-0002-3579-4600 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.department | Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü | en_US |
dc.institutionauthor | Taş, Duygu | - |
item.grantfulltext | open | - |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | en | - |
item.openairetype | Conference Object | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
Appears in Collections: | Endüstri Mühendisliği Bölümü Koleksiyonu |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CIRRELT-2017-07.pdf | Yayıncı Sürümü | 1.1 MB | Adobe PDF | View/Open |
CORE Recommender
Page view(s)
14
checked on Nov 18, 2024
Download(s)
6
checked on Nov 18, 2024
Google ScholarTM
Check
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.