{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002512886,0.001288546,0.0009526087,0.0006532079,0.0005119467,0.002060111,0.001280371,0.001034943,0.004790666],"category_scores_gemma":[0.004668485,0.0007060859,0.001037412,0.00178739,0.0009025863,0.001977117,0.001252025,0.0023649,0.0007387058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008249242,"about_ca_system_score_gemma":0.002660804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004421295,"about_ca_topic_score_gemma":0.005129894,"domain_scores_codex":[0.9981206,0.0008628198,0.00009535983,0.0002295334,0.000504479,0.0001871799],"domain_scores_gemma":[0.9981524,0.001309925,0.0001732352,0.000176995,0.0001424406,0.00004498771],"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.00007308605,0.0001355607,0.0003540325,0.0003087084,0.00008749007,0.0001040914,0.00005523684,0.8231813,0.002107094,0.08188383,0.004008888,0.08770066],"study_design_scores_gemma":[0.00002469283,0.00002652552,0.00004645018,0.00002078871,0.00001496883,0.00002527134,0.00002768345,0.9626887,0.001250328,0.03195953,0.00390787,0.000007149227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004240828,0.0001967241,0.9886959,0.0003156129,0.00002881767,0.0001128957,0.0001321979,0.000304151,0.005972939],"genre_scores_gemma":[0.09129641,0.000610011,0.9050588,0.0001981426,0.00007235313,0.0002823276,0.0003211352,0.0001241614,0.002036764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004790666,"threshold_uncertainty_score":0.01602638,"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."}}