{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003756781,0.0002955041,0.0002828857,0.0005421846,0.0007594507,0.001436656,0.0002259613,0.0005732111,0.0003388624],"category_scores_gemma":[0.0008284569,0.0003128854,0.00007024402,0.0006968892,0.0001647761,0.002576818,0.00008762312,0.0007195176,0.0003174246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009181122,"about_ca_system_score_gemma":0.0004811299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001223298,"about_ca_topic_score_gemma":0.00001877226,"domain_scores_codex":[0.9964754,0.0003740693,0.001087253,0.0002328887,0.001078891,0.0007514923],"domain_scores_gemma":[0.9973441,0.0005976942,0.0001905948,0.0002393955,0.001294741,0.0003334656],"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.00003733968,0.0001169843,0.001478618,0.0007005969,0.0001273254,0.000007696815,0.01520416,0.8589345,0.00008017661,0.02388396,0.006395523,0.09303311],"study_design_scores_gemma":[0.001296123,0.00009985921,0.001522849,0.0003368591,0.00001780917,0.0001655345,0.002347331,0.9298168,0.0003427961,0.00008392356,0.06366394,0.0003061618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1356341,0.009719423,0.8184118,0.01399087,0.001523455,0.004095702,0.000739046,0.0004281253,0.01545747],"genre_scores_gemma":[0.839219,0.004835784,0.1476665,0.0001997384,0.0008888257,0.0007553808,0.0004081885,0.00005283872,0.00597374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7035848,"threshold_uncertainty_score":0.9999323,"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."}}