{"id":"W2255734301","doi":"10.1287/ijoc.2015.0666","title":"Decomposition Methods for the Parallel Machine Scheduling Problem with Setups","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Job shop scheduling; Solver; Mathematical optimization; Computer science; Travelling salesman problem; Scheduling (production processes); Metaheuristic; Decomposition; Benders' decomposition; Integer programming; Branch and bound; Algorithm; Mathematics; Routing (electronic design automation)","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.0008726877,0.0001570182,0.0001493379,0.0000960383,0.0003813052,0.0001532692,0.0001860645,0.00005247885,0.00001407903],"category_scores_gemma":[0.00005482305,0.00007153482,0.00007878902,0.0001361903,0.00002285977,0.0002207655,0.00001822361,0.0002592879,0.000009819558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007730929,"about_ca_system_score_gemma":0.0000252601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.729581e-7,"about_ca_topic_score_gemma":5.135101e-7,"domain_scores_codex":[0.9991189,0.00002174331,0.0003487597,0.00008930316,0.000145055,0.0002762328],"domain_scores_gemma":[0.9989094,0.0006297139,0.0001301627,0.0001198949,0.0001207098,0.00009010296],"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.00003097714,0.000005128304,0.00006311683,0.00001010644,0.00006097266,9.697924e-7,0.0001139009,0.7552961,0.00008721799,0.0003039336,0.00002538555,0.2440023],"study_design_scores_gemma":[0.001100212,0.0001262181,0.00009613531,0.0002448953,0.00002000996,0.0002006834,0.00005259316,0.9948173,0.0007621802,0.0004572935,0.001957644,0.0001648631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004815283,0.0002211396,0.9932613,0.0005682622,0.0003284661,0.0001809594,0.000001940726,0.0001767165,0.0004458844],"genre_scores_gemma":[0.1201494,0.00005520972,0.8792222,0.0001739882,0.0003181353,0.000006269019,0.000002286773,0.0000318823,0.00004056899],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2438374,"threshold_uncertainty_score":0.293273,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01518101738347567,"score_gpt":0.3035211131566281,"score_spread":0.2883400957731524,"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."}}