2021 journal article

Conic programming models for production planning with clearing functions: Formulations and duality

European Journal of Operational Research, 292(3), 953–966.

By: K. Gopalswamy n & R. Uzsoy n

author keywords: Capacity pricing; Congestion; Conic programming; Production planning
TL;DR: It is shown that several clearing function forms considered in the literature to date can be reformulated as conic programs (CPs), for which efficient solution methods and an elegant duality theory analogous to that for linear programming exist. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, Crossref, ORCID
Added: April 12, 2021

2020 article

A SIMULATION OPTIMIZATION APPROACH FOR MANAGING PRODUCT TRANSITIONS IN MULTISTAGE PRODUCTION LINES

2020 WINTER SIMULATION CONFERENCE (WSC), pp. 1730–1741.

By: A. Manda n, K. Gopalswamy n, S. Shashaani n & R. Uzsoy n

TL;DR: This work uses simulation optimization to develop solutions and examine the impact of learning at a single machine on the rest of the system, laying the foundation for studying product transitions using realistic fab scale simulation models. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 7, 2021

2019 journal article

A data-driven iterative refinement approach for estimating clearing functions from simulation models of production systems

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 57(19), 6013–6030.

By: K. Gopalswamy n & R. Uzsoy n

author keywords: regression; simulation; variable sampling; clearing functions; production planning
TL;DR: This work addresses the model misspecification problem by introducing a generalised functional form, and the sampling issues via iterative refinement of initial parameter estimates, and yields improved performance for planning models at higher levels of utilisation. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: October 7, 2019

2019 journal article

Valid inequalities for concave piecewise linear regression

OPERATIONS RESEARCH LETTERS, 47(1), 52–58.

By: K. Gopalswamy n, Y. Fathi n & R. Uzsoy n

author keywords: Concave regression; Piecewise linear fitting; Valid inequalities; Clearing function
TL;DR: Results with univariate data show that the proposed valid inequalities improve the root relaxation lower bound, permitting significant improvements in solution time. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: February 18, 2019

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.