MétaCan
Menu
Back to cohort
Record W2161003186 · doi:10.1109/acc.2001.945916

Optimal production scheduling for manufacturing systems with preventive maintenance in an uncertain environment

2001· article· en· W2161003186 on OpenAlexaff
J.J. Westmann, Floyd B. Hanson, E.K. Boukas

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicScheduling and Optimization Algorithms
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsPreventive maintenanceScheduling (production processes)Computer scienceWorkstationParameterized complexityMathematical optimizationDiscrete manufacturingJob shop schedulingPoisson processProduction (economics)Reliability engineeringQuadratic equationSchedulePoisson distributionEngineeringMathematicsAlgorithm

Abstract

fetched live from OpenAlex

Consider a manufacturing system in which a single consumable good is fabricated in a process that consists of k stages in an uncertain environment. On each stage, there are a number of workstations that are assumed to have different operating parameters that are subject to failure, repair, and preventive maintenance which generate discrete jumps in the value of the state. A just-in-time manufacturing discipline is assumed for the workstations with running costs that include penalties for shortfall and surplus production. The formulation presented for the optimal production scheduling for the manufacturing system requires extensions to the results of the LQGP problem with state dependent Poisson processes (SDPP) by the inclusion of coefficients for the dynamics and the costs that are parameterized by the value of the state. The cost functional used is fully quadratic which is an enhancement for the LQGP problem. The functionality of this canonical model is demonstrated with a numerical example.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.013
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.013
GPT teacher head0.219
Teacher spread0.206 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations5
Published2001
Admission routes1
Has abstractyes

Explore more

Same topicScheduling and Optimization AlgorithmsFrench-language works237,207