{"id":"W2958544563","doi":"10.1287/ijoc.2018.0854","title":"An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Scheduling (production processes); Variable (mathematics); Mathematical optimization; Mathematics; Computer science; Branch and bound; Branch and cut; Integer programming","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.0005804647,0.0002311011,0.0002679839,0.0001765478,0.0002229148,0.0003191376,0.0002125942,0.0001113084,0.00002004923],"category_scores_gemma":[0.00003350577,0.0001950603,0.00008858254,0.0001623485,0.00001430102,0.0004493865,0.00002658342,0.0005191795,0.00002230613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006470321,"about_ca_system_score_gemma":0.00003019249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000291136,"about_ca_topic_score_gemma":6.101049e-7,"domain_scores_codex":[0.9987137,0.00001141786,0.0005054545,0.0001695226,0.0001879582,0.0004119868],"domain_scores_gemma":[0.9992126,0.0001132652,0.0001573163,0.0001665342,0.000136592,0.0002137031],"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.000008912103,0.00001403081,0.0001881428,0.00004061388,0.00004051198,9.148696e-7,0.000281496,0.7877537,0.0001510348,0.00005974307,0.000006070395,0.2114548],"study_design_scores_gemma":[0.001550238,0.000241259,0.0001561386,0.0001228301,0.000009590704,0.000112481,0.00008193793,0.9965247,0.0001735225,0.0001976299,0.0005439014,0.00028576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1052773,0.0002595584,0.8923922,0.00004880052,0.001016802,0.0003007218,0.000005140662,0.0002731789,0.0004263018],"genre_scores_gemma":[0.3937986,0.00007012624,0.6051971,0.0002601205,0.0005266544,0.000004574229,0.00001718495,0.00006266584,0.00006298772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2885213,"threshold_uncertainty_score":0.7954328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009286559904105242,"score_gpt":0.2374896438092046,"score_spread":0.2282030839050994,"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."}}