{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002452659,0.001248048,0.001367467,0.0030903,0.00165077,0.002802338,0.003004399,0.001428104,0.006201113],"category_scores_gemma":[0.01410819,0.00136845,0.001749007,0.003556046,0.00177813,0.003311426,0.001823764,0.003595013,0.0007217574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00259445,"about_ca_system_score_gemma":0.004370639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009203472,"about_ca_topic_score_gemma":0.01389025,"domain_scores_codex":[0.998113,0.0006790793,0.00008943119,0.0002353867,0.0006992631,0.0001837177],"domain_scores_gemma":[0.9934429,0.004776201,0.0003340734,0.0005584826,0.000734484,0.0001538423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008213481,0.0001695388,0.0006225429,0.0002557625,0.00007201607,0.00009772642,0.0001855233,0.6845816,0.001595558,0.2082706,0.005114105,0.09895294],"study_design_scores_gemma":[0.00001856955,0.00001960683,0.00006730056,0.00002974197,0.00001664862,0.00001596804,0.00003342809,0.8976538,0.0005337023,0.09903517,0.002566668,0.000009297389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004343663,0.0001703092,0.9895586,0.0003905027,0.00004621004,0.0002036131,0.0001949252,0.0003187474,0.0047735],"genre_scores_gemma":[0.1099123,0.0004773907,0.8857013,0.0002110753,0.00007160201,0.0005876588,0.0009584537,0.0002351228,0.00184512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009203472,"threshold_uncertainty_score":0.0207448,"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."}}