{"id":"W1981704813","doi":"10.1016/j.cor.2011.11.017","title":"Lagrangian relaxation and constraint generation for allocation and advanced scheduling","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":60,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Lagrangian relaxation; Computer science; Mathematical optimization; Scheduling (production processes); Markov decision process; Exploit; Column generation; Job shop scheduling; Dynamic priority scheduling; Lagrangian; Markov process; Schedule; Mathematics; Applied 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002230363,0.0001275688,0.0001657071,0.0003038078,0.00308793,0.00009554673,0.0000934577,0.0001949573,0.00004941048],"category_scores_gemma":[0.0006238519,0.00012472,0.00002161345,0.0003250485,0.0001555856,0.0004560147,0.00007435994,0.0004333889,0.00001785315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001275798,"about_ca_system_score_gemma":0.0004424096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003620107,"about_ca_topic_score_gemma":0.0008395165,"domain_scores_codex":[0.9978018,0.0006505168,0.0004933461,0.0004340746,0.0002154088,0.0004048321],"domain_scores_gemma":[0.9977858,0.0003490468,0.0000491566,0.000246574,0.001382438,0.0001869584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002556444,0.0003457184,0.007126544,0.0007361455,0.0001159968,0.000004143103,0.07752692,0.05175783,0.04415096,0.5343879,0.001917604,0.2816747],"study_design_scores_gemma":[0.001081762,0.0002538755,0.003550856,0.0001646364,0.000009938725,0.000004021394,0.003570717,0.9895467,0.0003434084,0.0003468057,0.0009444974,0.0001827801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4628862,0.0001971126,0.5310441,0.002855839,0.0002692924,0.00217397,0.00001524572,0.00006558158,0.0004926324],"genre_scores_gemma":[0.7166165,0.0002150472,0.2816832,0.0002589764,0.000216153,0.0005322271,0.0002039347,0.00002047643,0.0002534778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9377888,"threshold_uncertainty_score":0.9982099,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2900679938174112,"score_gpt":0.4849974540499111,"score_spread":0.1949294602324999,"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."}}