{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008870304,0.0001683207,0.0001927549,0.0001807202,0.0003992002,0.0004015408,0.0001396465,0.0001156562,0.000009469171],"category_scores_gemma":[0.00008665665,0.0001487272,0.00006961469,0.0001416474,0.00008788185,0.0001894598,0.00003626307,0.001049836,0.000006007461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000372687,"about_ca_system_score_gemma":0.00005067622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001142703,"about_ca_topic_score_gemma":9.090926e-7,"domain_scores_codex":[0.9988297,0.000007858608,0.0004181201,0.0001169698,0.0002107821,0.000416535],"domain_scores_gemma":[0.9992033,0.0002413693,0.00007246103,0.00009316115,0.0001660161,0.0002236934],"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.000008709229,0.000007707475,0.0006645634,0.000035244,0.0000312057,0.000006169998,0.0005963654,0.5889105,0.0001745848,0.001442744,0.000005339371,0.4081169],"study_design_scores_gemma":[0.000874997,0.00009316657,0.0001526726,0.0001380126,0.000007708453,0.0003942858,0.00111281,0.99568,0.0008120388,0.00006469776,0.000467637,0.0002020086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4327304,0.00003412174,0.5656422,0.00005800257,0.0007861825,0.0001047399,8.217596e-7,0.0001525685,0.0004909699],"genre_scores_gemma":[0.6997358,0.000006364918,0.2998414,0.00006763838,0.0003154722,0.000001645599,0.000001860988,0.00002455038,0.000005272317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4079149,"threshold_uncertainty_score":0.606492,"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."}}