{"id":"W2110515532","doi":"10.1111/itor.12105","title":"A simulated annealing with multiple‐search paths and parallel computation for a comprehensive flowshop scheduling problem","year":2014,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Simulated annealing; Computer science; Computation; Job shop scheduling; Scheduling (production processes); Mathematical optimization; Algorithm; Mathematics; Schedule","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.0007275215,0.0001331169,0.0001377884,0.0005189119,0.0003669565,0.0001731975,0.0001498715,0.00007064897,0.0001097667],"category_scores_gemma":[0.00009009668,0.0001362865,0.0000322066,0.0003929591,0.00008427756,0.0002687122,0.00001192945,0.0004573583,0.000005138588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001830736,"about_ca_system_score_gemma":0.00008222526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007689914,"about_ca_topic_score_gemma":0.00007754267,"domain_scores_codex":[0.9983633,0.0001225483,0.0002999088,0.0003011094,0.0006381319,0.000275048],"domain_scores_gemma":[0.997889,0.001157208,0.00001590026,0.00008732914,0.0007693663,0.00008122504],"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.0001327577,0.00005669771,0.0003634191,0.0000332183,0.00005259966,0.000001582971,0.0005221108,0.9920316,0.0003657946,0.0007363658,0.000008567787,0.005695235],"study_design_scores_gemma":[0.001875281,0.00009770178,0.0006372599,0.00005014389,0.000003764651,0.00001293757,0.0005506574,0.9956079,0.0001542876,0.0002095438,0.0006478518,0.0001526456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1115518,0.00006519804,0.8864528,0.0006202477,0.0001485817,0.0005904009,0.00004838965,0.0001188769,0.000403675],"genre_scores_gemma":[0.7494507,0.00004989705,0.2499312,0.00003485762,0.00006860994,0.0002011844,0.0001666232,0.00002968129,0.00006726371],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6378989,"threshold_uncertainty_score":0.5557602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06234362332256328,"score_gpt":0.3542725529256587,"score_spread":0.2919289296030954,"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."}}