{"id":"W2077698456","doi":"10.1002/nav.20066","title":"On the asymptotic optimality of algorithms for the flow shop problem with release dates","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Heuristics; Heuristic; Probabilistic logic; Focus (optics); Probabilistic analysis of algorithms; Computer science; Mathematical optimization; Asymptotically optimal algorithm; Algorithm; Flow (mathematics); Flow shop scheduling; Analysis of algorithms; Mathematics; Artificial intelligence; Job shop scheduling; Routing (electronic design automation)","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.01534375,0.001829592,0.00223185,0.002269487,0.002123346,0.00415917,0.003455314,0.002662475,0.004442536],"category_scores_gemma":[0.07921603,0.001170395,0.0016197,0.002267111,0.003804323,0.006928654,0.002991314,0.003348494,0.00101973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00441359,"about_ca_system_score_gemma":0.004854486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002939194,"about_ca_topic_score_gemma":0.002495622,"domain_scores_codex":[0.9897114,0.005208692,0.0004328912,0.001199746,0.002070196,0.001376956],"domain_scores_gemma":[0.8978118,0.08996797,0.00323631,0.005045891,0.002967105,0.0009709463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0024262,0.000482266,0.003254413,0.0004549241,0.0002098949,0.00009222801,0.0002879459,0.8010748,0.00438005,0.0981034,0.005634722,0.08359925],"study_design_scores_gemma":[0.0002225436,0.0001608084,0.0005955257,0.00004846941,0.00005377728,0.00006652695,0.00004070456,0.9452621,0.00157633,0.05116059,0.0007943974,0.00001828912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1955364,0.00462093,0.7718562,0.002591714,0.000303766,0.0002290868,0.0003179711,0.002340261,0.02220364],"genre_scores_gemma":[0.8003817,0.001797212,0.1926193,0.0006029214,0.0005498899,0.0003541055,0.0006463382,0.0006893936,0.002359177],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01534375,"threshold_uncertainty_score":0.08114648,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09894512376433645,"score_gpt":0.3454533077296663,"score_spread":0.2465081839653298,"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."}}