{"id":"W2187584737","doi":"","title":"Solving Resource Allocation/Scheduling Problems with Constraint Integer Programming","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Integer programming; Mathematical optimization; Computer science; Concurrent constraint logic programming; Constraint logic programming; Decomposition; Scheduling (production processes); Benders' decomposition; Decomposition method (queueing theory); Constraint satisfaction; Generalization; Mathematics; Stochastic programming; Artificial intelligence; Discrete mathematics","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.0002471216,0.000121593,0.00009643607,0.0001037344,0.0001388323,0.0001588411,0.0002693872,0.00004509634,0.0001798797],"category_scores_gemma":[0.00002685609,0.00009663796,0.00002960462,0.0003134885,0.00009401154,0.000501557,0.00007149174,0.0001271053,0.0000272181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003203837,"about_ca_system_score_gemma":0.00009217746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004553657,"about_ca_topic_score_gemma":0.00007256755,"domain_scores_codex":[0.999034,0.0000324552,0.0002130737,0.0003133082,0.0001789938,0.0002281242],"domain_scores_gemma":[0.9993638,0.00003284312,0.00009409556,0.0002855949,0.0001286715,0.00009499466],"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.00001189637,0.0001280583,0.007966671,0.00003571373,0.00006070271,0.0000140328,0.01036195,0.008551498,0.0003739602,0.3885032,0.00008636108,0.5839059],"study_design_scores_gemma":[0.001314309,0.0003841122,0.00528287,0.0002829977,0.00003064707,0.0003846216,0.003871919,0.9707782,0.00452877,0.001809821,0.01027113,0.001060546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001363305,0.00001235389,0.9600143,0.0004274086,0.00005756062,0.0002487188,1.342359e-7,0.0004279665,0.03744826],"genre_scores_gemma":[0.5361266,0.000001401663,0.4635111,0.0001587689,0.00001068275,0.00001797767,0.000001450755,0.000005764415,0.0001661752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9622267,"threshold_uncertainty_score":0.3940782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0259289450491757,"score_gpt":0.2136287232734865,"score_spread":0.1876997782243108,"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."}}