4.7 Article

Joint replenishment and pricing decisions in inventory systems with stochastically dependent supply capacity

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 191, Issue 1, Pages 142-155

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2007.08.012

Keywords

inventory; pricing; dependent capacity; modified base-stock policy; list-price; markup; markdown

Ask authors/readers for more resources

In this paper, we study a joint optimization problem of replenishment and pricing for a periodic-review inventory system with random supply capacity. When making replenishment and pricing decisions at the beginning of each period, the firm only knows the supplier's available capacity in the current period, but does not know what will be the available capacity in future periods. The salient feature of our model is that the random supply capacities for different periods are dependent. Several stochastic dependency structures are considered for the supply capacity sequence, including the one-lag and the multi-lag dependency. We show that the optimal inventory control policy is of the modified base-stock type and the base-stock level is decreasing in the available capacity of the current period and that the optimal pricing policy is a list-price coined with markdown and markup. This paper generalizes the work of Federgruen and Zipkin [Federgruen, A., Zipkin, P., 1986a. An inventory model with limited production capacity and uncertain demands I. The- average cost criterion. Mathematics of Operations Research 11, 193-207; Federgruen, A., Zipkin, P., 1986b. An inventory model with limited production capacity and uncertain demands II. The discounted cost criterion. Mathematics of Operations Research 11, 208-215] in which the supply capacity and selling price are assumed to be fixed constants, and the work of Federgruen and Heching [Federgruen, A., Heching, A., 1999. Combining pricing and inventory control under uncertainty. Operations Research, 47, 454-475] on joint optimization of replenishment and pricing with unlimited supply capacity. (c) 2007 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Engineering, Manufacturing

Optimal Policies for a Two-Product Inventory System under a Flexible Substitution Scheme

He Xu, David D. Yao, Shaohui Zheng

PRODUCTION AND OPERATIONS MANAGEMENT (2016)

Article Operations Research & Management Science

Optimal pricing and inventory policies with reliable and random-yield suppliers: characterization and comparison

Xiuli Chao, Xiting Gong, Shaohui Zheng

ANNALS OF OPERATIONS RESEARCH (2016)

Article Engineering, Industrial

Periodic-review inventory systems with random yield and demand: Bounds and heuristics

Qing Li, He Xu, Shaohui Zheng

IIE TRANSACTIONS (2008)

Article Management

Dynamic Capacity Expansion for a Service Firm with Capacity Deterioration and Supply Uncertainty

Xiuli Chao, Hong Chen, Shaohui Zheng

OPERATIONS RESEARCH (2009)

Article Engineering, Manufacturing

Dynamic Pricing and Inventory Management with Dual Suppliers of Different Lead Times and Disruption Risks

Xiting Gong, Xiuli Chao, Shaohui Zheng

PRODUCTION AND OPERATIONS MANAGEMENT (2014)

Article Engineering, Industrial

Dynamic release policies for software systems with a reliability constraint

SH Zheng

IIE TRANSACTIONS (2002)

Article Engineering, Industrial

Dynamic quality control in assembly systems

SH Zheng

IIE TRANSACTIONS (2000)

Review Management

Survey of optimization models for power system operation and expansion planning with demand response

Vinicius N. Motta, Miguel F. Anjos, Michel Gendreau

Summary: This survey presents a review of optimization approaches for the integration of demand response in power systems planning and highlights important future research directions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines

Philipp Schulze, Armin Scholl, Rico Walter

Summary: This paper proposes an improved branch-and-bound algorithm, R-SALSA, for solving the simple assembly line balancing problem, which performs well in balancing workloads and providing initial solutions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Adaptive scheduling in service systems: A Dynamic programming approach

Roshan Mahes, Michel Mandjes, Marko Boon, Peter Taylor

Summary: This paper discusses appointment scheduling and presents a phase-type-based approach to handle variations in service times. Numerical experiments with dynamic scheduling demonstrate the benefits of rescheduling.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Discrete scheduling and critical utilization

Oleg S. Pianykh, Sebastian Perez, Chengzhao Richard Zhang

Summary: Efficient scheduling is crucial for optimizing resource allocation and system performance. This study focuses on critical utilization and efficient scheduling in discrete scheduling systems, and compares the results with classical queueing theory.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Review Management

Supply chain network design with financial considerations: A comprehensive review

Hamed Jahani, Babak Abbasi, Jiuh-Biing Sheu, Walid Klibi

Summary: Supply chain network design is a large and growing area of research. This study comprehensively surveys and analyzes articles published from 2008 to 2021 to detect and report financial perspectives in SCND models. The study also identifies research gaps and offers future research directions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

A branch-and-cut algorithm for the connected max- k-cut problem

Patrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sebastien Martin, Zsuzsanna Roka

Summary: The Connected Max-k-Cut Problem is an extension of the well-known Max-Cut Problem, where the objective is to partition a graph into k connected subgraphs by maximizing the cost of inter-partition edges. The researchers propose a new integer linear program and a branch-and-cut algorithm for this problem, and also use graph isomorphism to structure the instances and facilitate their resolution. Extensive computational experiments show that, if k > 2, their approach outperforms existing algorithms in terms of quality.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Estimating production functions through additive models based on regression splines

Victor J. Espana, Juan Aparicio, Xavier Barber, Miriam Esteve

Summary: This paper introduces a new methodology based on the machine learning technique MARS for estimating production functions that satisfy classical production theory axioms. The new approach overcomes the overfitting problem of DEA through generalized cross-validation and demonstrates better performance in reducing mean squared error and bias compared to DEA and C2NLS methods.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Time-flexible min completion time variance in a single machine by quadratic programming

Stefano Nasini, Rabia Nessah

Summary: In this paper, the authors investigate the impact of time flexibility in job scheduling, showing that it can significantly affect operators' ability to solve the problem efficiently. They propose a new methodology based on convex quadratic programming approaches that allows for optimal solutions in large-scale instances.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Convex support vector regression

Zhiqiang Liao, Sheng Dai, Timo Kuosmanen

Summary: Nonparametric regression subject to convexity or concavity constraints is gaining popularity in various fields. The conventional convex regression method often suffers from overfitting and outliers. This paper proposes the convex support vector regression method to address these issues and demonstrates its advantages in prediction accuracy and robustness through numerical experiments.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

A simulation evacuation framework for effective disaster preparedness strategies and response decision making

Kuo-Hao Chang, Ying-Zheng Wu, Wen-Ray Su, Lee-Yaw Lin

Summary: The damage and destruction caused by earthquakes necessitates the evacuation of affected populations. Simulation models, such as the Stochastic Pedestrian Cell Transmission Model (SPCTM), can be utilized to enhance disaster and evacuation management. The analysis of SPCTM provides insights for government officials to formulate effective evacuation strategies.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

An effective hybrid evolutionary algorithm for the clustered orienteering problem

Qinghua Wu, Mu He, Jin-Kao Hao, Yongliang Lu

Summary: This paper studies a variant of the orienteering problem known as the clustered orienteering problem. In this problem, customers are grouped into clusters and a profit is associated with each cluster, collected only when all customers in the cluster are served. The proposed evolutionary algorithm, incorporating a backbone-based crossover operator and a destroy-and-repair mutation operator, outperforms existing algorithms on benchmark instances and sets new records on some instances. It also demonstrates scalability on large instances and has shown superiority over three state-of-the-art COP algorithms. The algorithm is also successfully applied to a dynamic version of the COP considering stochastic travel time.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Improving uplift model evaluation on randomized controlled trial data

Bjorn Bokelmann, Stefan Lessmann

Summary: Estimating treatment effects is an important task for data analysts, and uplift models provide support for efficient allocation of treatments. However, evaluating uplift models is challenging due to variance issues. This paper theoretically analyzes the variance of uplift evaluation metrics, proposes variance reduction methods based on statistical adjustment, and demonstrates their benefits on simulated and real-world data.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Newsvendor conditional value-at-risk minimisation: A feature-based approach under adaptive data selection

Congzheng Liu, Wenqi Zhu

Summary: This paper proposes a feature-based non-parametric approach to minimizing the conditional value-at-risk in the newsvendor problem. The method is able to handle both linear and nonlinear profits without prior knowledge of the demand distribution. Results from numerical and real-life experiments demonstrate the robustness and effectiveness of the approach.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Right-left asymmetry of the eigenvector method: A simulation study

Laszlo Csato

Summary: This paper compares the performance of the eigenvalue method and the row geometric mean as two weighting procedures. Through numerical experiments, it is found that the priorities derived from the two eigenvectors in the eigenvalue method do not always agree, while the row geometric mean serves as a compromise between them.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Compete or cooperate? Effects of channel relationships on government policies for sustainability

Guowei Dou, Tsan-Ming Choi

Summary: This study investigates the impact of channel relationships between manufacturers on government policies and explores the effectiveness of positive incentives versus taxes in increasing social welfare. The findings suggest that competition may be more effective in improving sustainability and social welfare. Additionally, government incentives for green technology may not necessarily enhance sustainability.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)