{"id":"W2027524005","doi":"10.1287/ijoc.1100.0388","title":"Combining Constraint Programming and Local Search for Job-Shop Scheduling","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Sandia National Laboratories; U.S. Department of Energy","keywords":"Tabu search; Constraint programming; Computer science; Job shop scheduling; Mathematical optimization; Guided Local Search; Flow shop scheduling; Hybrid algorithm (constraint satisfaction); Job shop; Local search (optimization); Scheduling (production processes); Iterated local search; Algorithm; Mathematics; Constraint logic programming; Schedule","routes":{"ca_aff":true,"ca_fund":true,"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.002623989,0.0008633861,0.001280913,0.001069741,0.0006201279,0.001361233,0.001945228,0.001016129,0.002185787],"category_scores_gemma":[0.006616609,0.0005576619,0.0006985915,0.002409145,0.000904112,0.001583196,0.00157106,0.00144688,0.0006017668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107608,"about_ca_system_score_gemma":0.001780217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006929432,"about_ca_topic_score_gemma":0.008932111,"domain_scores_codex":[0.9982609,0.0007855543,0.00006278719,0.0001957843,0.0005895257,0.0001053622],"domain_scores_gemma":[0.9963581,0.002756856,0.0001771244,0.0002933725,0.000323128,0.00009135423],"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.00008038448,0.00009969343,0.0003617638,0.0001432988,0.00008021111,0.00005415557,0.00006508654,0.8541378,0.001934847,0.02182688,0.001347775,0.1198682],"study_design_scores_gemma":[0.00001059151,0.00002306964,0.00004215157,0.000005072861,0.000008572222,0.00001003518,0.000006311581,0.9937361,0.0006120834,0.004929075,0.0006101386,0.000006745968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007011356,0.0002299999,0.9892884,0.0001175332,0.00002002251,0.0000727533,0.0000261629,0.0006260078,0.002607651],"genre_scores_gemma":[0.2572678,0.0003897291,0.7391751,0.0002064708,0.00007592687,0.0003833042,0.0001229813,0.0002633515,0.002115218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006929432,"threshold_uncertainty_score":0.01387715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01661260934949381,"score_gpt":0.2663230316757701,"score_spread":0.2497104223262763,"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."}}