MétaCan
Menu
Back to cohort
Record W3202252380 · doi:10.1080/03155986.2021.1971594

Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales

2021· article· en· W3202252380 on OpenAlexaffvenue
Majid Taghavi, Kai Huang, Amirmohsen Golmohammadi

Bibliographic record

VenueINFOR Information Systems and Operational Research · 2021
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicSupply Chain and Inventory Management
Canadian institutionsLaurentian UniversityMcMaster UniversitySaint Mary's University
Fundersnot available
KeywordsFixed chargeInteger (computer science)Mathematical optimizationPolynomialStochastic modellingTime complexityComputer scienceAlgorithmMathematicsStatistics

Abstract

fetched live from OpenAlex

In this paper, we consider multi-period single resource stochastic capacity expansion problems with lost sales. We study two models. The first model does not consider fixed-charge for capacity purchases, while the second one incorporates fixed-charges. We use multi-stage stochastic integer programs to present both models and show how adding the fixed-charge cost changes the structure of the mathematical models. For both models, we study their structures and design polynomial-time algorithms to solve them. We present computational results to show the performance of the designed algorithms.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.646
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0020.005
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.098
GPT teacher head0.285
Teacher spread0.187 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2021
Admission routes2
Has abstractyes

Explore more

Same venueINFOR Information Systems and Operational ResearchSame topicSupply Chain and Inventory ManagementFrench-language works237,207