{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463672,0.0009982488,0.001638938,0.001136641,0.0006622466,0.001212997,0.002488168,0.001289384,0.005788805],"category_scores_gemma":[0.003384009,0.0007007682,0.001009684,0.002183022,0.0004627235,0.001603365,0.001143287,0.002406571,0.001041819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009280709,"about_ca_system_score_gemma":0.00253629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004314221,"about_ca_topic_score_gemma":0.00393588,"domain_scores_codex":[0.9987747,0.0002835738,0.00006171536,0.0001836639,0.000520675,0.0001756666],"domain_scores_gemma":[0.9992424,0.0003501412,0.00006045632,0.00009117686,0.0002040839,0.00005177054],"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.0002052421,0.0002471316,0.000379683,0.0002158279,0.00007879511,0.0001316285,0.00005298738,0.6812649,0.003567355,0.02981832,0.008886809,0.2751513],"study_design_scores_gemma":[0.00004857889,0.00005042212,0.0000782883,0.000004416408,0.00001016503,0.0000304717,0.00000493943,0.9896505,0.0005879356,0.00767721,0.001850154,0.00000706084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01221684,0.0003310188,0.9820364,0.0001805425,0.0001015665,0.0001812726,0.000121545,0.0007234154,0.004107371],"genre_scores_gemma":[0.08627637,0.0002402682,0.9093622,0.0001042841,0.00009078543,0.0002479155,0.0004836674,0.0002798037,0.002914681],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005788805,"threshold_uncertainty_score":0.01936549,"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."}}