{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002946751,0.001734997,0.001328688,0.001065972,0.0009324601,0.001122318,0.001107197,0.001305841,0.001744578],"category_scores_gemma":[0.00488531,0.0009029386,0.0008651418,0.001130839,0.000962554,0.002227703,0.001259107,0.001618677,0.0004178091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008738209,"about_ca_system_score_gemma":0.002273295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0015965,"about_ca_topic_score_gemma":0.001749417,"domain_scores_codex":[0.9991952,0.0002866811,0.0000381068,0.00009988558,0.0002062484,0.0001738706],"domain_scores_gemma":[0.9977048,0.001634086,0.0002077308,0.0001096832,0.0002529179,0.00009072758],"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.0004087088,0.0002385924,0.0006137852,0.0002753596,0.00005515317,0.00008540246,0.0002418259,0.7920494,0.007824947,0.03456995,0.002831436,0.1608055],"study_design_scores_gemma":[0.0002556956,0.0001718797,0.0001706571,0.00001851758,0.00002335735,0.00005417711,0.00003059288,0.9611897,0.003262172,0.03341116,0.001395179,0.00001693461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05323182,0.0008310383,0.9428226,0.0002148132,0.00005729026,0.0001186312,0.0000609483,0.0004954077,0.002167364],"genre_scores_gemma":[0.243231,0.0009650369,0.751763,0.0001224323,0.0001045715,0.0004092344,0.000282415,0.0002658425,0.002856449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002946751,"threshold_uncertainty_score":0.01558411,"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."}}