default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahmut Parlar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Armagan Ozbilge
, Elkafi Hassini, Mahmut Parlar:
Optimal pricing and donation policy for fresh goods. Eur. J. Oper. Res. 312(1): 198-210 (2024)- [j39]Mingming Leng, Rafael Becerril-Arreola, Mahmut Parlar, Mark E. Ferguson:
Disclosing Delivery Performance Information When Consumers Are Sensitive to Promised Delivery Time, Delivery Reliability, and Price. Manuf. Serv. Oper. Manag. 26(5): 1918-1924 (2024) - [j38]Armagan Ozbilge, Elkafi Hassini, Mahmut Parlar:
Perils and Merits of Cross-Channel Returns. IEEE Trans. Engineering Management 71: 6257-6271 (2024) - 2023
- [j37]Mahmut Parlar:
Model Development with Maple in PhD-Level Management Science Courses: A Personal Account. Oper. Res. Forum 4(1) (2023) - 2022
- [j36]Armagan Ozbilge, Elkafi Hassini, Mahmut Parlar:
A review of bricks-and-clicks dual-channels literature: trends and opportunities. INFOR Inf. Syst. Oper. Res. 60(4): 436-472 (2022)
2010 – 2019
- 2018
- [j35]Sin-Hoon Hum, Mahmut Parlar, Yun Zhou:
Measurement and optimization of responsiveness in supply chain networks with queueing structures. Eur. J. Oper. Res. 264(1): 106-118 (2018) - [j34]Mahmut Parlar, Brian Rodrigues, Moosa Sharafali:
Event-based allocation of airline check-in counters: a simple dynamic optimization method supported by empirical data. Int. Trans. Oper. Res. 25(5): 1553-1582 (2018) - 2017
- [j33]Mabel C. Chou, Mahmut Parlar, Yun Zhou:
Optimal Timing to Initiate Medical Treatment for a Disease Evolving as a Semi-Markov Process. J. Optim. Theory Appl. 175(1): 194-217 (2017) - 2015
- [j32]Onno J. Boxma, Mahmut Parlar, David Perry:
A make-to-stock mountain-type inventory model. Ann. Oper. Res. 231(1): 65-77 (2015) - [j31]Behrouz Bakhtiari, Emre Berk, Elkafi Hassini, Mahmut Parlar:
Optimal Spacing of "Covered" and "Exposed" Time Intervals in a Stochastic Process with High Penalty Costs: Applications to Parking and Insurance. INFOR Inf. Syst. Oper. Res. 53(3): 142-154 (2015) - 2014
- [j30]Mingming Leng, Mahmut Parlar, Dengfeng Zhang:
Cooperative game analysis of retail space-exchange problems. Eur. J. Oper. Res. 232(2): 393-404 (2014) - 2013
- [j29]Savas Dayanik, Mahmut Parlar:
Dynamic bidding strategies in search-based advertising. Ann. Oper. Res. 211(1): 103-136 (2013) - [j28]Jian Huang, Mingming Leng, Mahmut Parlar:
Demand Functions in Decision Modeling: A Comprehensive Survey and Research Directions. Decis. Sci. 44(3): 557-609 (2013) - [j27]Rafael Becerril-Arreola, Mingming Leng, Mahmut Parlar:
Online retailers' promotional pricing, free-shipping threshold, and inventory decisions: A simulation-based analysis. Eur. J. Oper. Res. 230(2): 272-283 (2013) - 2012
- [j26]J. Song, Mahmut Parlar:
Analysis of a simple capacity game. Int. Trans. Oper. Res. 19(3): 435-461 (2012) - [j25]Susan Cholette, Özgür Özlük, Mahmut Parlar:
Optimal Keyword Bids in Search-Based Advertising with Stochastic Advertisement Positions. J. Optim. Theory Appl. 152(1): 225-244 (2012) - [j24]Mingming Leng, Mahmut Parlar:
Transfer pricing in a multidivisional firm: A cooperative game analysis. Oper. Res. Lett. 40(5): 364-369 (2012) - 2010
- [j23]Mingming Leng, Mahmut Parlar:
Game-theoretic analyses of decentralized assembly supply chains: Non-cooperative equilibria vs. coordination with cost-sharing contracts. Eur. J. Oper. Res. 204(1): 96-104 (2010)
2000 – 2009
- 2009
- [j22]Mingming Leng, Mahmut Parlar:
Allocation of Cost Savings in a Three-Level Supply Chain with Demand Information Sharing: A Cooperative-Game Approach. Oper. Res. 57(1): 200-213 (2009) - [j21]James S. K. Ang, Chengxuan Cao, Mahmut Parlar, Heng-Qing Ye:
Two-Stage Stochastic Integer Programming Model for Multiperiod Sea Cargo Mix Problem in Container Shipping Industry. IEEE Trans. Syst. Man Cybern. Part A 39(2): 460-465 (2009) - 2008
- [j20]Mahmut Parlar, Moosa Sharafali:
Dynamic Allocation of Airline Check-In Counters: A Queueing Optimization Approach. Manag. Sci. 54(8): 1410-1424 (2008) - 2007
- [j19]Shaul K. Bar-Lev, Mahmut Parlar, David Perry, Wolfgang Stadje, Frank A. Van der Duyn Schouten:
Applications of bulk queues to group testing models with incomplete identification. Eur. J. Oper. Res. 183(1): 226-237 (2007) - [j18]Liming Liu, Mahmut Parlar, Stuart X. Zhu:
Pricing and Lead Time Decisions in Decentralized Supply Chains. Manag. Sci. 53(5): 713-725 (2007) - 2006
- [j17]Mingming Leng, Mahmut Parlar:
Game-theoretic analysis of an ancient Chinese horse race problem. Comput. Oper. Res. 33: 2033-2055 (2006) - [j16]Mahmut Parlar, Z. Kevin Weng:
Coordinating pricing and production decisions in the presence of price competition. Eur. J. Oper. Res. 170(1): 211-227 (2006) - [j15]Mahmut Parlar, Moosa Sharafali, Jihong Ou:
Optimal parking of idle elevators under myopic and state-dependent policies. Eur. J. Oper. Res. 170(3): 863-886 (2006) - [j14]Jihong Ou, Mahmut Parlar, Moosa Sharafali:
A differentiated service scheme to optimize website revenues. J. Oper. Res. Soc. 57(11): 1323-1340 (2006) - 2005
- [j13]F.-S. Chou, Mahmut Parlar:
Optimal quota allocation for a revenue-maximizing auction holder facing a random number of bidders. Int. Trans. Oper. Res. 12(6): 559-580 (2005) - 2002
- [j12]Sila Çetinkaya, Mahmut Parlar:
Note: Optimality Conditions for an (s, S) Policy with Proportional and Lump-Sum Penalty Costs. Manag. Sci. 48(12): 1635-1639 (2002) - 2000
- [j11]Mahmut Parlar:
Probabilistic Analysis of Renewal Cycles: An Application to a Non-Markovian Inventory Problem with Multiple Objectives. Oper. Res. 48(2): 243-255 (2000)
1990 – 1999
- 1999
- [j10]Süleyman Özekici, Mahmut Parlar:
Inventory models with unreliable suppliersin a random environment. Ann. Oper. Res. 91: 123-136 (1999) - 1998
- [j9]Sila Çetinkaya, Mahmut Parlar:
Optimal myopic policy for a stochastic inventory problem with fixed and proportional backorder costs. Eur. J. Oper. Res. 110(1): 20-41 (1998) - 1997
- [j8]Ülkü Gürler, Mahmut Parlar:
An Inventory Problem with Two Randomly Available Suppliers. Oper. Res. 45(6): 904-918 (1997) - 1994
- [j7]Shaul K. Bar-Lev, Mahmut Parlar, David Perry:
On the EOQ model with inventory-level-dependent demand rate and random yield. Oper. Res. Lett. 16(3): 167-176 (1994) - [j6]Yash P. Aneja, Mahmut Parlar:
Technical Note - Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel. Transp. Sci. 28(1): 70-76 (1994)
1980 – 1989
- 1989
- [j5]Mahmut Parlar:
Solving dynamic optimization problems on a personal computer using an electronic spreadsheet. Autom. 25(1): 97-101 (1989) - [j4]Mahmut Parlar, Yigal Gerchak:
Control of a production system with variable yield and random demand. Comput. Oper. Res. 16(4): 315-324 (1989) - 1987
- [j3]Yigal Gerchak, Mahmut Parlar:
A Single period inventory problem with partially controllable demand. Comput. Oper. Res. 14(1): 1-9 (1987) - 1983
- [j2]Yigal Gerchak, Mahmut Parlar:
Modeling manpower systems in two-grade organizations. IEEE Trans. Syst. Man Cybern. 13(1) (1983) - 1982
- [j1]Mahmut Parlar:
Efficiency of rolling schedules for a class of stochastic control problems. Autom. 18(4): 493-495 (1982)
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-23 21:21 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:
