{"id":"W2996974428","doi":"10.1155/2019/3176074","title":"The Lagrangean Relaxation for the Flow Shop Scheduling Problem with Precedence Constraints, Release Dates and Delivery Times","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Ministerio de Economía y Competitividad; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Generalitat de Catalunya; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Scheduling (production processes); Truck; Automotive industry; Computer science; Relaxation (psychology); Mathematical optimization; Job shop scheduling; Integer programming; Flow shop scheduling; Product (mathematics); Operations research; Mathematics; Algorithm; Engineering; 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.0002308527,0.00008578739,0.00009766528,0.00003287124,0.0001196926,0.00004771087,0.00007530723,0.00003248288,0.00000639681],"category_scores_gemma":[0.00002791645,0.0000494157,0.00003409883,0.0000958808,0.00004512508,0.0003753313,6.868599e-7,0.0001391745,7.998291e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001555896,"about_ca_system_score_gemma":0.00002834721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.110637e-7,"about_ca_topic_score_gemma":0.00001935955,"domain_scores_codex":[0.9994155,0.00001025398,0.0002603538,0.00007217114,0.0001417659,0.00009993066],"domain_scores_gemma":[0.9992005,0.000302817,0.0001597312,0.00007294331,0.0002286213,0.00003533991],"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.0001243717,0.000004863816,0.0005065298,0.00004023139,0.00004576542,7.181546e-7,0.0006451385,0.9616295,0.000560193,0.0001782198,0.000005516691,0.03625901],"study_design_scores_gemma":[0.002709185,0.0003342545,0.01213709,0.0004683845,0.0002116404,0.00003313932,0.005366483,0.9742686,0.003011771,0.0005061296,0.000698429,0.0002549595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5728903,0.002416652,0.4232716,0.0004275058,0.0003489928,0.0005227096,0.00001607194,0.00005242041,0.00005369328],"genre_scores_gemma":[0.7667418,0.001236886,0.2318927,0.00001416984,0.00004866129,0.000009642302,0.00001494992,0.00001645468,0.00002473872],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1938515,"threshold_uncertainty_score":0.2015114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005582290749238984,"score_gpt":0.2036588486147136,"score_spread":0.1980765578654746,"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."}}