{"id":"W1843628981","doi":"10.1007/11564751_60","title":"Extending Systematic Local Search for Job Shop Scheduling Problems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Guided Local Search; Tabu search; Hill climbing; Local search (optimization); Local optimum; Beam search; Constructive; Computer science; Iterated local search; Search algorithm; Mathematical optimization; Iterative deepening depth-first search; Best-first search; Depth-first search; Incremental heuristic search; Backtracking; Theoretical computer science; Mathematics; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009184643,0.0003964535,0.0005349549,0.0006227777,0.0001752724,0.0002894285,0.0007366367,0.0002974058,0.0000196287],"category_scores_gemma":[0.0000592766,0.0003701631,0.0001152621,0.000306271,0.0002346993,0.0001875757,0.0001290882,0.0005989706,0.00002921877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003854247,"about_ca_system_score_gemma":0.000127493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001798237,"about_ca_topic_score_gemma":0.00001013772,"domain_scores_codex":[0.9976977,0.00001326342,0.0005330217,0.0006274044,0.0005666903,0.00056196],"domain_scores_gemma":[0.9987278,0.0004182352,0.000075032,0.0004592564,0.0001846167,0.0001350447],"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.000001137683,0.000003521415,0.000002889824,0.002664766,0.00001357844,0.000003960397,0.0002748481,0.9408791,0.00002136254,0.0007523142,8.958428e-7,0.0553816],"study_design_scores_gemma":[0.0001827956,0.00003376437,0.000001228554,0.005096717,0.00001705142,0.00003009947,0.000001113769,0.9924737,0.0003761754,0.001350318,0.00002378087,0.000413225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004614861,0.001900054,0.9948286,0.00006838631,0.001233767,0.000821364,0.000004865909,0.0003094349,0.0007873693],"genre_scores_gemma":[0.08387413,0.00007580165,0.9146304,0.0001289606,0.0008449376,0.00004732031,0.000008280264,0.0001076713,0.0002825645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08382798,"threshold_uncertainty_score":0.999875,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02173820630715946,"score_gpt":0.2507987553215996,"score_spread":0.2290605490144401,"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."}}