{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197785,0.0001706155,0.0001821716,0.00009294562,0.000304325,0.0001061729,0.0005452765,0.00009743235,0.00007952948],"category_scores_gemma":[0.002157826,0.00009213372,0.00006150922,0.0004409533,0.0003895987,0.00005856093,0.0000670848,0.0006080859,0.00003856865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001061354,"about_ca_system_score_gemma":0.0001154872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002695583,"about_ca_topic_score_gemma":0.00002007894,"domain_scores_codex":[0.9980602,0.0001180983,0.0002819036,0.0002411588,0.0007866404,0.0005119991],"domain_scores_gemma":[0.9950193,0.003688088,0.00004071343,0.0005677834,0.0005713803,0.0001127249],"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.00009376884,0.00006984653,0.00002166328,0.0000613797,0.00006971913,0.00000233346,0.0001364941,0.9739763,0.0000375274,0.009592044,0.002244608,0.01369436],"study_design_scores_gemma":[0.0004320864,0.000248101,0.00005223842,0.00005405503,0.00002300037,0.000002908686,0.0001712918,0.9945313,0.001782627,0.001249796,0.001327721,0.0001249279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003787168,0.000595858,0.9852685,0.003143904,0.0001699378,0.001477602,0.0001934518,0.000208556,0.005155034],"genre_scores_gemma":[0.6991305,0.0002470169,0.2992513,0.00007895478,0.0003493357,0.0002198564,0.00004167649,0.00006865998,0.0006127286],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6953433,"threshold_uncertainty_score":0.3757104,"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."}}