default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeltem Denizel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Yoshinori Suzuki, Meltem Denizel:
An efficient system of incentivizing truck drivers to accept night loads. Int. J. Prod. Res. 62(11): 3819-3834 (2024)- 2022
- [j15]Mehmet Ali Soytas
, Damla Durak Usar, Meltem Denizel:
Estimation of the static corporate sustainability interactions. Int. J. Prod. Res. 60(4): 1245-1264 (2022) - 2021
- [j14]Ihsan Yanikoglu, Meltem Denizel:
The value of quality grading in remanufacturing under quality level uncertainty. Int. J. Prod. Res. 59(3): 839-859 (2021)
2010 – 2019
- 2014
- [j13]Öznur Özdemir-Akyildirim, Meltem Denizel, Mark E. Ferguson:
Allocation of Returned Products among Different Recovery Options through an Opportunity Cost-Based Dynamic Approach. Decis. Sci. 45(6): 1083-1116 (2014) - 2012
- [j12]Öznur Özdemir, Meltem Denizel, V. Daniel R. Guide Jr.:
Recovery decisions of a producer in a legislative disposal fee environment. Eur. J. Oper. Res. 216(2): 293-300 (2012) - 2010
- [j11]Meltem Denizel, Mark E. Ferguson, Gilvan C. Souza:
Multiperiod Remanufacturing Planning With Uncertain Quality of Inputs. IEEE Trans. Engineering Management 57(3): 394-404 (2010)
2000 – 2009
- 2009
- [j10]Haldun Süral, Meltem Denizel, Luk N. Van Wassenhove:
Lagrangean relaxation based heuristics for lot sizing with setup times. Eur. J. Oper. Res. 194(1): 51-63 (2009) - 2008
- [j9]Meltem Denizel, Fatma Tevhide Altekin, Haldun Süral, Hartmut Stadtler:
Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times. OR Spectr. 30(4): 773-785 (2008) - 2007
- [j8]Meltem Denizel, Utkan Ekinci, Güven Özyurt, Deniz Turhan:
Ford-Otosan Optimizes Its Stocks Using a Six-Sigma Framework. Interfaces 37(2): 97-107 (2007) - 2006
- [j7]Meltem Denizel, Haldun Süral:
On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times. J. Oper. Res. Soc. 57(4): 389-399 (2006) - 2003
- [j6]Meltem Denizel:
Minimization of the Number of Tool Magazine Setups on Automated Machines: A Lagrangean Decomposition Approach. Oper. Res. 51(2): 309-320 (2003) - [j5]Meltem Denizel, Behlul Usdiken, Deniz Tuncalp:
Drift or Shift? Continuity, Change, and International Variation in Knowledge Production in OR/MS. Oper. Res. 51(5): 711-720 (2003)
1990 – 1999
- 1998
- [j4]Meltem Denizel, Serpil Sayin:
Part-type selection in flexible manufacturing systems: a bicriteria approach with due dates. J. Oper. Res. Soc. 49(6): 659-669 (1998) - 1997
- [j3]Meltem Denizel, S. Selçuk Erengüç:
Exact solution procedures for certain planning problems in flexible manufacturing systems. Comput. Oper. Res. 24(11): 1043-1055 (1997) - [j2]Meltem Denizel, S. Selçuk Erengüç, Harold P. Benson:
Dynamic lot-sizing with setup cost reduction. Eur. J. Oper. Res. 100(3): 537-549 (1997) - 1993
- [j1]Meltem Denizel-Sivri, S. Selçuk Erengüç:
A polynomial algorithm for a multi-item capacitated production planning problem. Oper. Res. Lett. 13(5): 287-293 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
