{"id":"W2084084982","doi":"10.1007/s10951-007-0043-7","title":"Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tabu search; Variable neighborhood search; Simulated annealing; Mathematical optimization; Hill climbing; Guided Local Search; Computer science; Local search (optimization); Scheduling (production processes); Beam search; Metaheuristic; Variable (mathematics); Search algorithm; Mathematics","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.001555472,0.0006258126,0.001436135,0.0006750134,0.0005303465,0.0005549788,0.001416821,0.001291196,0.001564542],"category_scores_gemma":[0.004709347,0.0005725886,0.0009276497,0.0007696452,0.000701022,0.0007930491,0.0007587456,0.00101048,0.0002060215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008364238,"about_ca_system_score_gemma":0.001391947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007900636,"about_ca_topic_score_gemma":0.006667608,"domain_scores_codex":[0.9991566,0.00050823,0.00002386411,0.00007133543,0.0001768049,0.00006322687],"domain_scores_gemma":[0.9985716,0.001059573,0.00007492626,0.00009882997,0.0001561526,0.00003886982],"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.00004797084,0.00003065508,0.0001400913,0.00001459614,0.0000246552,0.000009302792,0.00001785898,0.9875324,0.0003500136,0.003200696,0.0002979994,0.008333722],"study_design_scores_gemma":[0.000009949733,0.00001105493,0.00001761557,0.000001033741,0.000002925704,0.000001600554,0.000001433443,0.9990721,0.00007159259,0.0007172045,0.00009253273,9.575388e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06619765,0.0006037398,0.9262908,0.0002900847,0.0001549743,0.00009115908,0.00003258509,0.0005059448,0.00583314],"genre_scores_gemma":[0.6402707,0.0002139438,0.3563092,0.0001332987,0.0000627974,0.000254865,0.00009256315,0.0001631057,0.002499539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007900636,"threshold_uncertainty_score":0.01570928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01020203630421521,"score_gpt":0.2294490232960321,"score_spread":0.2192469869918169,"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."}}