{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001053112,0.0001701615,0.0001970653,0.0005670402,0.00007208286,0.0002112388,0.0003757384,0.00003735761,0.00000331234],"category_scores_gemma":[0.00001358947,0.0001145532,0.00005304351,0.001250958,0.00001619015,0.0001295658,0.00005087654,0.0002538959,0.000009583418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001575673,"about_ca_system_score_gemma":0.00003349992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000759861,"about_ca_topic_score_gemma":0.00001277512,"domain_scores_codex":[0.9985194,0.00005960493,0.0003963371,0.0001696977,0.0005251495,0.0003298675],"domain_scores_gemma":[0.9995696,0.00003326999,0.00009910396,0.0001954756,0.00005633827,0.00004624088],"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.00003701821,0.00009027383,0.0001761291,0.0002569972,0.0001716678,0.0002176362,0.004802869,0.9715108,0.00002230238,0.0001559836,0.0003839013,0.02217443],"study_design_scores_gemma":[0.001546717,0.0002015475,0.001007735,0.0004664364,0.0001325024,0.0002454004,0.01734467,0.9755953,0.00005284233,0.0001203236,0.002872141,0.0004143947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1797908,0.0004284433,0.7839873,0.001942431,0.0009288599,0.006090651,0.000009917628,0.0009665912,0.02585504],"genre_scores_gemma":[0.2967234,0.00009096917,0.7021563,0.00009166705,0.00007041309,0.0001672732,0.000009179385,0.00005040529,0.0006404115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1169326,"threshold_uncertainty_score":0.4671343,"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."}}