{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001034946,0.0008375891,0.001181299,0.0007010621,0.0006981099,0.0007622169,0.0008649997,0.00121856,0.001788575],"category_scores_gemma":[0.002214672,0.000709336,0.001075196,0.0007321677,0.00110122,0.0008293387,0.0008154717,0.0009771493,0.0001218693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001375351,"about_ca_system_score_gemma":0.001778956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008954003,"about_ca_topic_score_gemma":0.006538555,"domain_scores_codex":[0.9996105,0.0001843883,0.00001443036,0.00007406741,0.00007320269,0.00004351546],"domain_scores_gemma":[0.9993217,0.0005030442,0.00005334652,0.00003059915,0.00004923411,0.00004206889],"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.00001027408,0.000008530225,0.00005760443,0.00001109634,0.000007600031,0.00001331227,0.000009448529,0.9945706,0.0001809836,0.003400431,0.00007608136,0.001654101],"study_design_scores_gemma":[0.000004917652,0.000008977786,0.00002492907,0.000001611714,0.000002256114,0.000004092977,0.000002684299,0.9978536,0.00006386152,0.001916339,0.0001150083,0.000001724384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06067496,0.0002985921,0.9345806,0.0003699816,0.00003489649,0.000115565,0.00005124708,0.0001430143,0.003731132],"genre_scores_gemma":[0.6786042,0.0003143461,0.3170602,0.00007397759,0.00003611478,0.0003228147,0.0001040029,0.00006110592,0.003423209],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008954003,"threshold_uncertainty_score":0.01780373,"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."}}