{"id":"W1969628616","doi":"10.1111/itor.12071","title":"A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem","year":2014,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical optimization; Computer science; Ant colony optimization algorithms; Scheduling (production processes); Job shop scheduling; Multi-objective optimization; Set (abstract data type); Convergence (economics); Ant colony; Pareto principle; Local search (optimization); Pareto optimal; Mathematics; Routing (electronic design automation)","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.0007449154,0.0007462277,0.0007626114,0.0008258318,0.0004961689,0.0008781043,0.001129505,0.001031356,0.001852492],"category_scores_gemma":[0.001032076,0.0003729943,0.0005249295,0.0009249261,0.000514238,0.0004353869,0.0009543174,0.0006362504,0.0002509685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005257923,"about_ca_system_score_gemma":0.001023092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006533864,"about_ca_topic_score_gemma":0.005535433,"domain_scores_codex":[0.9995888,0.00019252,0.00001502382,0.00003701594,0.0001306866,0.00003599222],"domain_scores_gemma":[0.9996252,0.0002201081,0.00003284796,0.0000160466,0.00007523836,0.00003048434],"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.00002319379,0.00003044852,0.0001455384,0.00004365637,0.00002135455,0.00006406143,0.00002862391,0.974,0.001119095,0.007178069,0.0003585833,0.01698749],"study_design_scores_gemma":[0.000003445438,0.000007083036,0.0000136678,0.000001519331,0.000002058322,0.000005342815,0.000003273902,0.998925,0.00008122154,0.0007572107,0.0001989439,0.000001194364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01812886,0.0002153871,0.9756104,0.0001770418,0.00004957088,0.0000780247,0.00002592368,0.0001244868,0.005590447],"genre_scores_gemma":[0.5645778,0.0003882875,0.4286621,0.0001036662,0.00004980671,0.000369152,0.00006454749,0.0000748934,0.005709877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006533864,"threshold_uncertainty_score":0.01299167,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1385527995478368,"score_gpt":0.433266879528203,"score_spread":0.2947140799803662,"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."}}