{"id":"W4317725390","doi":"10.5267/j.jpm.2022.12.001","title":"Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Job shop scheduling; Bounded function; Mathematical optimization; Computer science; Minification; Dynamic programming; Sequence (biology); Scheduling (production processes); Limit (mathematics); Blocking (statistics); Flow shop scheduling; Linear programming; Algorithm; 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.000964418,0.0009947167,0.0008985989,0.000642413,0.0004847957,0.0007473308,0.001301422,0.0007647408,0.002441256],"category_scores_gemma":[0.00171629,0.0005654948,0.0007533158,0.0008038342,0.0005485616,0.0007943325,0.0007303586,0.001325411,0.0002673531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007433451,"about_ca_system_score_gemma":0.002219322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003856848,"about_ca_topic_score_gemma":0.003578296,"domain_scores_codex":[0.9994451,0.0002203846,0.00001833819,0.00008111417,0.0001447125,0.00009024025],"domain_scores_gemma":[0.9994931,0.0003317889,0.00004911573,0.00002111459,0.00005926873,0.00004563043],"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.00004142215,0.0000489193,0.0001492011,0.000113216,0.00002923298,0.0000387804,0.00003600251,0.9650856,0.001897153,0.01095832,0.0006192418,0.02098289],"study_design_scores_gemma":[0.000007227888,0.00003137212,0.0000412041,0.000005952158,0.000004756775,0.000013034,0.000008238808,0.9948547,0.0004482814,0.004111433,0.0004705145,0.000003269124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007724281,0.0001604379,0.9903297,0.0001102639,0.00002548563,0.00004747078,0.00003137194,0.0001275405,0.001443366],"genre_scores_gemma":[0.3403149,0.0005745763,0.655216,0.0001249512,0.00005552176,0.0003969413,0.0001980869,0.0001870692,0.002931945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003856848,"threshold_uncertainty_score":0.00816679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02172900066633121,"score_gpt":0.2639030284277405,"score_spread":0.2421740277614093,"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."}}