{"id":"W2095614028","doi":"10.1007/s00236-011-0146-7","title":"An efficient algorithm for finding ideal schedules","year":2011,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Ideal (ethics); Theory of computation; Schedule; Computer science; Scheduling (production processes); Algorithm; Time complexity; Mathematics; Mathematical optimization","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.002106678,0.001314114,0.001401676,0.002376142,0.001430667,0.001534173,0.002137554,0.001143963,0.008423164],"category_scores_gemma":[0.007151952,0.001017121,0.001164254,0.002436791,0.001205784,0.00243867,0.002021923,0.001578661,0.001767563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001692319,"about_ca_system_score_gemma":0.003823216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002894259,"about_ca_topic_score_gemma":0.004417006,"domain_scores_codex":[0.9987902,0.0003308609,0.00007014054,0.0002292897,0.0004066854,0.0001727559],"domain_scores_gemma":[0.9978637,0.001303337,0.0001526123,0.0002819747,0.0003008549,0.00009758474],"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.0007201703,0.0002545236,0.0006779985,0.0003885691,0.00008061137,0.0001515936,0.0002985477,0.4667116,0.004388608,0.1147543,0.01628752,0.3952858],"study_design_scores_gemma":[0.0001804105,0.000133822,0.0001365928,0.00003817536,0.0000386065,0.0001240546,0.00008556883,0.891627,0.002236326,0.09842807,0.006944782,0.00002669557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005364931,0.0001722304,0.9893919,0.0001420207,0.00005361621,0.0001229798,0.0001177026,0.0008081601,0.003826414],"genre_scores_gemma":[0.05889463,0.0001842685,0.9380245,0.00005640082,0.00003181663,0.0002216572,0.0002939124,0.0001544053,0.002138464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008423164,"threshold_uncertainty_score":0.02817822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0219740094869949,"score_gpt":0.2399925613728733,"score_spread":0.2180185518858784,"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."}}