{"id":"W2067880102","doi":"10.1002/jos.94","title":"Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times","year":2002,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Acadia University; McMaster University; Memorial University of Newfoundland","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Dominance (genetics); Algorithm; Flow shop scheduling; Scheduling (production processes); Branch and bound; Retard; Sequence (biology); Mathematics; Schedule","routes":{"ca_aff":true,"ca_fund":false,"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.0007383233,0.0002282658,0.0003026099,0.000206525,0.0001321281,0.000172286,0.0004954223,0.00006745062,0.0002695342],"category_scores_gemma":[0.0001824686,0.0001129443,0.0000900722,0.0007304452,0.0000384617,0.0002044546,0.00002512634,0.0006379079,0.00003219584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005671913,"about_ca_system_score_gemma":0.00003408947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007284201,"about_ca_topic_score_gemma":0.00001481501,"domain_scores_codex":[0.9984636,0.00008840551,0.0005266243,0.0001409562,0.0004589624,0.0003214552],"domain_scores_gemma":[0.999058,0.0002458545,0.0001284308,0.0002624995,0.0001409347,0.0001642533],"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.00008191416,0.00005056973,0.0002814974,0.00001388086,0.00005295344,0.0001561496,0.001841502,0.9743122,0.00004208363,0.000008584696,0.0001032239,0.0230554],"study_design_scores_gemma":[0.00138069,0.00009240171,0.0002325493,0.0001837323,0.00005027193,0.0004984195,0.002180657,0.9945702,0.0002127935,0.00002404644,0.0003730695,0.0002011618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.194146,0.003359942,0.788087,0.0106553,0.00128074,0.0005402814,0.00001725175,0.0001766999,0.001736705],"genre_scores_gemma":[0.4261478,0.000225356,0.571887,0.0007627764,0.000631602,0.00001254743,0.000002214123,0.00006918861,0.0002615374],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2320017,"threshold_uncertainty_score":0.4605735,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01849426096806984,"score_gpt":0.2333307052857025,"score_spread":0.2148364443176327,"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."}}