{"id":"W2008645045","doi":"10.1023/b:anor.0000030687.72169.c7","title":"Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"McGill University","keywords":"Job shop scheduling; Theory of computation; Computer science; Idle; Mathematical optimization; Flow shop scheduling; Approximation algorithm; Scheduling (production processes); Schedule; Time complexity; Algorithm; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.001097509,0.0001355638,0.000198136,0.0006970713,0.0001779615,0.0001510744,0.0002344271,0.00006866281,0.0001595006],"category_scores_gemma":[0.0004297421,0.0001393359,0.00004699234,0.001148723,0.00004045718,0.0002768803,0.00005238693,0.0003724072,0.0001536376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006343874,"about_ca_system_score_gemma":0.0001402089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004837002,"about_ca_topic_score_gemma":0.004003053,"domain_scores_codex":[0.9984048,0.00007784387,0.0004087712,0.0002406359,0.0004656205,0.000402303],"domain_scores_gemma":[0.9989393,0.00007324557,0.000007717366,0.0003190253,0.0005055899,0.0001551398],"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.00001588998,0.0000704881,0.0003133034,0.00001560663,0.0000151622,0.000004542941,0.0007950224,0.9920128,0.002569211,0.001039703,0.00003467514,0.003113593],"study_design_scores_gemma":[0.0006593779,0.0000560564,0.0007408762,0.00008003171,0.000001803962,0.000002646631,0.0002301906,0.9833672,0.01453242,0.0001195528,0.00006145538,0.0001484012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5818076,0.0006349976,0.4096013,0.005653541,0.0001712027,0.00062781,0.00003358915,0.0001357557,0.001334208],"genre_scores_gemma":[0.7371928,0.0001145533,0.2622649,0.00009727549,0.00009024591,0.00009021267,0.00004475114,0.00003052831,0.00007469617],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1553852,"threshold_uncertainty_score":0.5681955,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1263837306121213,"score_gpt":0.4156692742237378,"score_spread":0.2892855436116165,"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."}}