Show simple item record

Supply Chain and Revenue Management for Online Retailing

dc.contributor.authorJiang, Yuchen
dc.date.accessioned2018-06-07T17:48:48Z
dc.date.availableNO_RESTRICTION
dc.date.available2018-06-07T17:48:48Z
dc.date.issued2018
dc.date.submitted2018
dc.identifier.urihttps://hdl.handle.net/2027.42/144159
dc.description.abstractThis dissertation focuses on optimizing inventory and pricing decisions in the online retail industry. Motivated by the importance of great customer service quality in the online retail marketplace, we investigate service-level-constrained inventory control problems in both static and dynamic settings. The first essay studies multi-period production planning problems (with or without pricing options) under stochastic demand. A joint service-level constraint is enforced to restrict the joint probability of having backorders in any period. We use the Sample Average Approximation (SAA) approach to reformulate both chance-constrained models as mixed-integer linear programs (MILPs). Via computations of diverse instances, we demonstrate the effectiveness of the SAA approach, analyze the solution feasibility and objective bounds, and conduct sensitivity analysis. The approaches can be generalized to a wide variety of production planning problems. The second essay investigates the dynamic versions of the service-level-constrained inventory control problems, in which retailers have the flexibility to adjust their inventory policies in each period. We formulate two periodic-review stochastic inventory models (backlogging model and remanufacturing model) via Dynamic Programs (DP), and establish the optimality of generalized base-stock policies. We also propose 2-approximation algorithms for both models, which is computationally more efficient than the brute-force DP. The core concept developed in our algorithms is called the delayed marginal cost, which is proven effective in dealing with service-level-constrained inventory systems. The third essay is motivated by the exploding use of sales rank information in today's internet-based e-commerce marketplace. The sales rank affects consumers' shopping preference and therefore, is critical for retailers to utilize when making pricing decisions. We study periodic-review dynamic pricing problems in presence of sales rank, in which customers' demand is a function of both prices and sales rank. We propose rank-based pricing models and characterize the structure and monotonicity of optimal pricing policies. Our numerical experiments illustrate the potential of revenue increases when strategic cyclic policy is used.
dc.language.isoen_US
dc.subjectinventory control
dc.subjectrevenue management
dc.subjectservice-level
dc.subjectsales rank
dc.subjectapproximation algorithm
dc.titleSupply Chain and Revenue Management for Online Retailing
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineIndustrial & Operations Engineering
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studies
dc.contributor.committeememberShen, Siqian May
dc.contributor.committeememberShi, Cong
dc.contributor.committeememberKapuscinski, Roman
dc.contributor.committeememberNagarajan, Viswanath
dc.subject.hlbsecondlevelIndustrial and Operations Engineering
dc.subject.hlbtoplevelEngineering
dc.description.bitstreamurlhttps://deepblue.lib.umich.edu/bitstream/2027.42/144159/1/ycjiang_1.pdf
dc.identifier.orcid0000-0003-3591-7970
dc.identifier.name-orcidJiang, Yuchen; 0000-0003-3591-7970en_US
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.