{"id":"W3206961072","doi":"10.5267/j.ijiec.2021.8.003","title":"An algorithm for a no-wait flowshop scheduling problem for minimizing total tardiness with a constraint on total completion time","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Kuwait University","keywords":"Tardiness; Benchmark (surveying); Computer science; Algorithm; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Mathematics; Schedule","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007667851,0.001044807,0.001062153,0.0007369653,0.0008943459,0.0008522093,0.001589578,0.001654079,0.004216116],"category_scores_gemma":[0.002060545,0.0004137431,0.0006822278,0.0007937851,0.0004156358,0.0008187683,0.0009077676,0.0009933757,0.0006386039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001046849,"about_ca_system_score_gemma":0.00389204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006416744,"about_ca_topic_score_gemma":0.008669152,"domain_scores_codex":[0.9996164,0.00006991649,0.00002071258,0.0001124512,0.0001002415,0.00008023719],"domain_scores_gemma":[0.9994738,0.0002729227,0.00005591694,0.00003527636,0.000112692,0.00004952516],"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.0002814981,0.0003024305,0.0007795395,0.0002430628,0.00005655178,0.0001228787,0.0001276277,0.8245991,0.004770088,0.01269196,0.006299447,0.1497259],"study_design_scores_gemma":[0.0001009759,0.00008934714,0.0001240661,0.00001011766,0.00001084926,0.00004403606,0.00003103543,0.9944173,0.0007186359,0.003174204,0.001271627,0.000007819704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.027822,0.0002491012,0.964411,0.000433124,0.0001375616,0.0003665469,0.0001436499,0.0008877302,0.005549307],"genre_scores_gemma":[0.1906937,0.0001537488,0.8048054,0.0001377969,0.00005357734,0.0005015607,0.000321872,0.0001090355,0.003223368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006416744,"threshold_uncertainty_score":0.01410425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01973675339379084,"score_gpt":0.2510146695728745,"score_spread":0.2312779161790837,"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."}}