{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003404332,0.001455432,0.002108625,0.001344244,0.0008718104,0.001647845,0.001898871,0.001841847,0.006597355],"category_scores_gemma":[0.009675405,0.001487631,0.001619359,0.002548598,0.001613031,0.002102677,0.001855171,0.003406353,0.0008471399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001586554,"about_ca_system_score_gemma":0.002737378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01163696,"about_ca_topic_score_gemma":0.008575024,"domain_scores_codex":[0.9986959,0.0007717466,0.00004247036,0.0001254567,0.0002553549,0.0001090176],"domain_scores_gemma":[0.9961733,0.003002777,0.000200582,0.0001850605,0.0003458575,0.00009249613],"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.00005804313,0.00005433856,0.00006797361,0.0001199026,0.00002334969,0.0000346483,0.00004798426,0.9187513,0.0002740826,0.04787342,0.002856693,0.02983832],"study_design_scores_gemma":[0.00001949357,0.00001024006,0.00002039302,0.0000115128,0.000003939266,0.000004128696,0.000006499826,0.9775311,0.00009083359,0.0215187,0.0007783458,0.000004850344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002673847,0.0003871055,0.9922012,0.000268511,0.0001096283,0.00007372336,0.00009168014,0.0001005122,0.004093715],"genre_scores_gemma":[0.1373371,0.0007669194,0.8526409,0.0002357007,0.0002379676,0.0005414824,0.0003608294,0.0002542332,0.007624923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01163696,"threshold_uncertainty_score":0.02313846,"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."}}