{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216271,0.001630216,0.00111452,0.00126676,0.0005608353,0.0009939228,0.001067807,0.001104315,0.004566712],"category_scores_gemma":[0.005091585,0.0007765234,0.001760869,0.001349632,0.0008229512,0.001375664,0.001315918,0.001993643,0.000646715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009608751,"about_ca_system_score_gemma":0.001496697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002946181,"about_ca_topic_score_gemma":0.002581218,"domain_scores_codex":[0.9989286,0.0005172117,0.00004102731,0.0001277425,0.0002478469,0.000137556],"domain_scores_gemma":[0.9981828,0.001389499,0.0001372607,0.00009769203,0.0001217156,0.00007092351],"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.0000697686,0.00008119724,0.0002608135,0.0001694214,0.00004920458,0.00005119137,0.00005626809,0.9272266,0.001421454,0.02821457,0.001315802,0.04108363],"study_design_scores_gemma":[0.00001959974,0.00002442246,0.00005318587,0.00001411728,0.00000836809,0.00001622922,0.000011321,0.9804217,0.0002750127,0.01832431,0.0008273597,0.000004378563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006732046,0.0003593559,0.9898021,0.0001466044,0.00004367008,0.00006546503,0.00005756375,0.0001447147,0.002648565],"genre_scores_gemma":[0.1995841,0.0009475087,0.794213,0.0001490149,0.000130566,0.0003754042,0.0003954229,0.0002905082,0.003914397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004566712,"threshold_uncertainty_score":0.01527715,"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."}}