{"id":"W2005705791","doi":"10.1016/j.tcs.2011.08.030","title":"Minimizing total completion time for re-entrant flow shop scheduling problems","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flow shop scheduling; Scheduling (production processes); Computer science; Completion (oil and gas wells); Mathematical optimization; Job shop scheduling; Mathematics; Schedule; Engineering; Mechanical engineering","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007441142,0.0001495512,0.0001712745,0.0001063048,0.0002232733,0.0001156236,0.0003605871,0.00005401785,0.0001692289],"category_scores_gemma":[0.00005152158,0.0001363234,0.00005924224,0.0003522417,0.0005852935,0.000203712,0.00007163557,0.0001209557,0.00006600188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004024351,"about_ca_system_score_gemma":0.00002286217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.061956e-7,"about_ca_topic_score_gemma":7.929397e-8,"domain_scores_codex":[0.9987072,0.00002020282,0.0002425717,0.000333444,0.0002627279,0.0004338953],"domain_scores_gemma":[0.9993411,0.00009396487,0.00002354289,0.0002477348,0.0001237517,0.0001698813],"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.0000266523,0.00007052882,0.00002148127,0.00006115055,0.00001797614,0.000003088907,0.002606395,0.8460669,0.002389995,0.1310207,0.00003410145,0.01768102],"study_design_scores_gemma":[0.0002570738,0.00008228308,0.00007020563,0.00005089597,0.000008984632,0.0000116716,0.00001543807,0.9919069,0.003725517,0.003665416,0.000008280946,0.0001973255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03184994,0.00002704967,0.9651317,0.00005173054,0.000586751,0.0002245116,0.000004337168,0.0004084056,0.00171559],"genre_scores_gemma":[0.4599021,0.000001675627,0.5399347,0.00003376985,0.00009752034,0.000009149557,0.000003596727,0.0000134148,0.000004020415],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4280522,"threshold_uncertainty_score":0.5559109,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02033348561854315,"score_gpt":0.2199177957508809,"score_spread":0.1995843101323377,"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."}}