{"id":"W2022726105","doi":"10.1108/13552510810861932","title":"Optimal disassembly sequencing strategy using constraint programming approach","year":2008,"lang":"en","type":"article","venue":"Journal of Quality in Maintenance Engineering","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Centre for Interdisciplinary Research in Rehabilitation","funders":"","keywords":"Mathematical optimization; Maintainability; Computer science; Constraint programming; Process (computing); Linear programming; Engineering; Reliability engineering; Algorithm; Stochastic programming; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007599324,0.0002170569,0.0004094043,0.0002305718,0.00004747967,0.00004544185,0.0001887361,0.00009973965,0.000004379518],"category_scores_gemma":[0.0001284135,0.0002063588,0.0001084501,0.000263123,0.00004304067,0.000423708,0.00001878991,0.0004779731,4.764807e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004091845,"about_ca_system_score_gemma":0.00008630782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001897362,"about_ca_topic_score_gemma":0.000001425002,"domain_scores_codex":[0.9983035,0.00002795126,0.000843276,0.0001330051,0.000278597,0.0004136097],"domain_scores_gemma":[0.9994193,0.00005743245,0.0001871016,0.0001252514,0.0001027625,0.0001081771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009368416,0.00001979806,0.0002754773,0.0002776929,0.00002791547,0.00007023848,0.0009077406,0.9947289,0.002531355,0.0001986363,0.000006018807,0.0009468232],"study_design_scores_gemma":[0.0004938029,0.00003397993,0.001284806,0.0002766337,0.00001031997,0.000666268,0.000998239,0.9933004,0.002530013,0.00001508194,0.00009354182,0.000296884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5482995,0.00018422,0.4511325,0.000006883823,0.0001432129,0.00006605417,0.000001164242,0.00005349364,0.0001129717],"genre_scores_gemma":[0.8812948,0.00009739889,0.1184314,0.000007233414,0.0001238224,0.000003404892,0.000001407571,0.00003359821,0.000006970509],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3329953,"threshold_uncertainty_score":0.8415068,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04998087028882556,"score_gpt":0.2713092925294812,"score_spread":0.2213284222406557,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}