{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001676222,0.0001247407,0.000122521,0.0001061276,0.0000934993,0.00005418044,0.0001803395,0.00007620065,0.0001071404],"category_scores_gemma":[0.00003165492,0.000118105,0.00004561905,0.0001164666,0.00002137646,0.0002862893,0.00001408906,0.00008999883,0.0000727317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002671365,"about_ca_system_score_gemma":0.00001451137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002554801,"about_ca_topic_score_gemma":3.471594e-7,"domain_scores_codex":[0.9992754,0.000004972223,0.0002759759,0.00007114104,0.0001132777,0.0002592492],"domain_scores_gemma":[0.9995559,0.00003769212,0.00003603215,0.0002051081,0.00005128013,0.0001140291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002874472,0.0002345386,0.0001653582,0.0004056478,0.0002426478,0.000004031439,0.02338757,0.350792,0.0001831379,0.0107832,0.001071067,0.6127021],"study_design_scores_gemma":[0.0002873731,0.00004524246,0.0001177043,0.00002083231,0.00001204935,0.00000371963,0.0005499217,0.9964714,0.001746961,0.00008764974,0.0004882546,0.0001688611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0398907,0.00002746362,0.9530604,0.000009692807,0.000407039,0.0002182389,0.00002135181,0.0005321331,0.005832953],"genre_scores_gemma":[0.2856219,0.000007585777,0.7141602,0.00005555741,0.00005671687,0.00003556818,0.00003255902,0.00002065059,0.000009221515],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6456794,"threshold_uncertainty_score":0.4816181,"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."}}