{"id":"W2104290979","doi":"10.1016/s0004-3702(99)00099-5","title":"Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Heuristic; Mathematical optimization; Scheduling (production processes); Constraint (computer-aided design); Exploit; Job shop scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Schedule","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001812325,0.0001782516,0.0002273256,0.0002468223,0.0002606487,0.0002778303,0.0004015882,0.0001020662,0.001676056],"category_scores_gemma":[0.0001798988,0.0001839534,0.000158699,0.001517491,0.0001197946,0.0002713547,0.00003209625,0.000139904,0.00009373482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006242887,"about_ca_system_score_gemma":0.0001276433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006233496,"about_ca_topic_score_gemma":0.0003906713,"domain_scores_codex":[0.9984469,0.00005469691,0.0004665142,0.000504991,0.0002157037,0.0003112359],"domain_scores_gemma":[0.9989468,0.0002226058,0.00011193,0.0003698332,0.0002311292,0.0001176903],"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.00002183713,0.00003955368,0.0001516773,0.000009861627,0.00013958,0.000004337381,0.0006048332,0.1798216,0.0007817317,0.0719979,0.00001259107,0.7464145],"study_design_scores_gemma":[0.00002356548,0.00004714685,0.0001906922,0.00001251517,0.00009276268,0.00001086149,0.0001085193,0.9565501,0.00410415,0.03838088,0.0002554359,0.0002234225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02490659,0.00002543656,0.9726424,0.0007479201,0.0001620928,0.0003334049,0.00004018288,0.0003473318,0.0007946577],"genre_scores_gemma":[0.6876032,0.00002141068,0.3120263,0.0001716371,0.00002013307,0.00001404868,0.00002116158,0.000007457021,0.0001145901],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7767285,"threshold_uncertainty_score":0.9992365,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01929389070529535,"score_gpt":0.284133776847167,"score_spread":0.2648398861418716,"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."}}