{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00435879,0.002496134,0.003322357,0.001346249,0.0008054125,0.001631807,0.002499931,0.001701264,0.003049639],"category_scores_gemma":[0.005845035,0.001166011,0.001597177,0.001681548,0.0009083949,0.002157204,0.001033815,0.002014563,0.0003857331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001661543,"about_ca_system_score_gemma":0.002129438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004109444,"about_ca_topic_score_gemma":0.0036179,"domain_scores_codex":[0.9980301,0.0009726785,0.00008132596,0.0002548855,0.0003183035,0.0003426074],"domain_scores_gemma":[0.9958903,0.002503559,0.0004865248,0.0002256926,0.0004564401,0.0004374347],"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.0004097998,0.0001768974,0.0003122337,0.0003366066,0.00009169644,0.00009757414,0.00007911356,0.9704705,0.004100549,0.005030841,0.001044867,0.01784939],"study_design_scores_gemma":[0.00003592948,0.0002506892,0.0002951926,0.0000121476,0.00003685892,0.00003314939,0.00002558315,0.9921302,0.001588233,0.00518166,0.0003970276,0.00001323655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2193353,0.001325261,0.7718836,0.0004978146,0.0001810412,0.0003905334,0.0004613342,0.0006033533,0.005321663],"genre_scores_gemma":[0.7594614,0.000918373,0.2298021,0.0001203699,0.0001624014,0.0003491923,0.0007093909,0.0005853905,0.007891366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00435879,"threshold_uncertainty_score":0.02305174,"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."}}