{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002714748,0.0002151777,0.0003128637,0.0003059249,0.00007886053,0.0002087217,0.0001788348,0.0001253168,0.00002686934],"category_scores_gemma":[0.0003336284,0.0002196231,0.0001624191,0.0002030662,0.00002182357,0.0002688364,0.00001311813,0.0002996695,0.00000410651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001843654,"about_ca_system_score_gemma":0.0002470232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001351781,"about_ca_topic_score_gemma":2.696292e-7,"domain_scores_codex":[0.998616,0.00002015089,0.0005852567,0.0001870044,0.0003732944,0.0002183055],"domain_scores_gemma":[0.9975263,0.0003857846,0.0001600028,0.00009319487,0.001662815,0.00017191],"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.00007287656,0.00008996695,0.000004377682,0.00001284125,0.0003620836,0.0000196981,0.0001097987,0.9805581,0.001502863,0.0002602464,0.0001326568,0.01687448],"study_design_scores_gemma":[0.003330666,0.0003199678,0.00001589207,0.0003588029,0.00005824877,0.0003944212,0.00009925147,0.9934783,0.001355387,0.00002968915,0.0003141279,0.0002452385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03653789,0.00002761857,0.9602587,0.0003001862,0.002218598,0.0002890376,0.0001968471,0.0001296682,0.00004141485],"genre_scores_gemma":[0.126471,0.000002839765,0.8706782,0.00003818353,0.002380104,0.00003917918,0.0002998112,0.00006569205,0.00002491615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08993311,"threshold_uncertainty_score":0.8955972,"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."}}