{"id":"W2398344949","doi":"10.1080/03155986.2002.11732657","title":"Algorithme D’optimisation Par Colonie De Fourmis Avec Matrices De Visibilité Multiples Pour La Résolution D’un Problème D’ordonnancement industriel","year":2002,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Scheduling (production processes); Ant colony optimization algorithms; Job shop scheduling; Mathematical optimization; Parallel computing; Algorithm; Mathematics; Schedule","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.0008873385,0.001189096,0.0009747694,0.0007717266,0.0006504993,0.0009204636,0.000882165,0.001426721,0.004392753],"category_scores_gemma":[0.002373435,0.0004718798,0.0007780882,0.000636942,0.0009123011,0.0009422877,0.0007741849,0.00151618,0.0007536802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007322598,"about_ca_system_score_gemma":0.00134106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.012547,"about_ca_topic_score_gemma":0.0129694,"domain_scores_codex":[0.9995545,0.0001399701,0.00001935519,0.0001030949,0.0001272727,0.00005593276],"domain_scores_gemma":[0.9990196,0.0006337999,0.00007421632,0.00005489053,0.0001790321,0.00003848494],"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.0001850285,0.00007703754,0.0004993059,0.00008928554,0.00007470886,0.0001021661,0.0001332502,0.8202193,0.008854198,0.01031279,0.001476546,0.1579765],"study_design_scores_gemma":[0.0000493253,0.00006324627,0.0001417996,0.000007993824,0.000009155389,0.00002913836,0.00001872254,0.9937084,0.001492868,0.002017214,0.002451867,0.00001027314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01427379,0.0001620496,0.9830517,0.0001188948,0.00005592259,0.00006143565,0.00002730632,0.0004395202,0.001809465],"genre_scores_gemma":[0.1734454,0.000225101,0.8201344,0.00008449118,0.00004566084,0.0003390649,0.0001267877,0.0001371391,0.005461964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.012547,"threshold_uncertainty_score":0.02494794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04868736254836448,"score_gpt":0.2933498444033706,"score_spread":0.2446624818550062,"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."}}