{"id":"W1491168799","doi":"10.1109/icsmc.2002.1175710","title":"A simulated annealing technique for multi-route cluster tools","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Simulated annealing; Computer science; Schedule; Mathematical optimization; Scheduling (production processes); Adaptive simulated annealing; Job shop scheduling; Critical path method; Shortest path problem; Algorithm; Parallel computing; Distributed computing; Theoretical computer science; Mathematics; Engineering","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.0006224823,0.0006456631,0.0006129987,0.0004281542,0.0005158183,0.0004756393,0.0009472675,0.0008316158,0.002519042],"category_scores_gemma":[0.001602048,0.0006528305,0.001052875,0.0005097584,0.0005211835,0.0005652627,0.0005628107,0.001101452,0.0005151962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009683966,"about_ca_system_score_gemma":0.001025393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003148315,"about_ca_topic_score_gemma":0.004032951,"domain_scores_codex":[0.9993314,0.0002685728,0.00002675605,0.00007547852,0.0002452908,0.00005253153],"domain_scores_gemma":[0.9995504,0.0002114525,0.00004790957,0.00008530288,0.00008865106,0.00001621829],"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.00005038396,0.00003100207,0.0001853999,0.00006245582,0.00004445292,0.00003633169,0.00006368303,0.946373,0.008232003,0.014697,0.0009120894,0.02931225],"study_design_scores_gemma":[0.00001785635,0.00004113403,0.00008398354,0.000007201879,0.00001185595,0.00002253215,0.000008085507,0.9865312,0.004291323,0.004349425,0.004626524,0.000008861826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007442689,0.000113488,0.9888259,0.0001043399,0.00002674854,0.00007247966,0.00002683646,0.0006096212,0.002777958],"genre_scores_gemma":[0.1739796,0.0001634022,0.8221335,0.00006692788,0.000011501,0.000359076,0.00009006087,0.0001846018,0.003011189],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003148315,"threshold_uncertainty_score":0.008427024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03704327241917189,"score_gpt":0.2756912655421297,"score_spread":0.2386479931229579,"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."}}