{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001350934,0.00009643045,0.0000953324,0.0000517012,0.00004089779,0.00004300674,0.00005103505,0.0000916069,0.00006195743],"category_scores_gemma":[0.0001154349,0.00009134444,0.00004368558,0.0001203529,0.00000604953,0.00008396817,0.000004286307,0.00006511855,0.00001467795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002533696,"about_ca_system_score_gemma":0.0000081115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002017303,"about_ca_topic_score_gemma":0.000001917746,"domain_scores_codex":[0.9995221,0.000008268785,0.0001504454,0.0001058081,0.00004451236,0.0001688651],"domain_scores_gemma":[0.9997032,0.00007206782,0.00001060833,0.0001152387,0.00005203198,0.00004681978],"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.00000258047,0.000007579727,0.00003581742,0.00001633636,0.00001335662,4.061241e-7,0.00004581774,0.9980544,0.000475536,0.0002740817,0.000154342,0.0009197334],"study_design_scores_gemma":[0.0006052095,0.000008894692,0.00000765721,0.0000130674,0.000005972688,0.000002730817,0.00002720508,0.9716346,0.02503483,0.0000416639,0.002478451,0.0001396775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001659312,0.00004797876,0.9951779,0.0000123583,0.0002035813,0.0003956654,0.000007172778,0.0005949728,0.001901099],"genre_scores_gemma":[0.1087302,0.000005589849,0.89047,0.0001264905,0.00002423321,0.00005008966,0.00001332375,0.00003450373,0.0005455403],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1070709,"threshold_uncertainty_score":0.3724918,"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."}}