{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008910151,0.00192992,0.001165674,0.001959069,0.00065287,0.001859985,0.001820861,0.0009204496,0.006709527],"category_scores_gemma":[0.001461097,0.000879833,0.001478338,0.00203295,0.0005968437,0.001187571,0.0008262399,0.001218603,0.0007819579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00187037,"about_ca_system_score_gemma":0.00311729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01258435,"about_ca_topic_score_gemma":0.009582194,"domain_scores_codex":[0.9991003,0.0002505123,0.00004674434,0.0002143448,0.0002638577,0.0001242971],"domain_scores_gemma":[0.9993442,0.0003451252,0.00008666411,0.00003071268,0.0001539379,0.00003940801],"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.00005671215,0.00008765032,0.0003379372,0.0002909127,0.0000480785,0.0001705874,0.00008464653,0.9073579,0.002338998,0.03258889,0.00149857,0.0551391],"study_design_scores_gemma":[0.000012598,0.00004604382,0.00009330202,0.00003884277,0.00001694494,0.00004763751,0.00003368769,0.9847933,0.001104731,0.01088808,0.002912054,0.0000128183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006838188,0.0004044292,0.9831935,0.0001321541,0.00002238756,0.0001965855,0.0001536767,0.0001620276,0.008897078],"genre_scores_gemma":[0.1693823,0.001114288,0.819521,0.0001395652,0.00003361472,0.0006844692,0.0006057625,0.0001736851,0.008345411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01258435,"threshold_uncertainty_score":0.02502221,"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."}}