{"id":"W2968482180","doi":"10.1016/j.cie.2019.07.048","title":"Minimizing the makespan in a flow shop environment under minimum and maximum time-lag constraints","year":2019,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Tabu search; Greedy algorithm; Integer programming; Computer science; Linear programming; Flow shop scheduling; Constraint (computer-aided design); Scheduling (production processes); 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.001303953,0.0009919566,0.00111786,0.0006333375,0.0005579495,0.001219893,0.000875476,0.0008751237,0.001225321],"category_scores_gemma":[0.002230721,0.0006144049,0.0004811956,0.0009245009,0.0006488535,0.001175854,0.0006717921,0.0006161433,0.0001013732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008645431,"about_ca_system_score_gemma":0.001852023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004620441,"about_ca_topic_score_gemma":0.004058674,"domain_scores_codex":[0.9993631,0.0002389846,0.00002631528,0.00007857866,0.0001055241,0.0001874088],"domain_scores_gemma":[0.9985575,0.0009555974,0.0001615065,0.00004014723,0.0001128576,0.0001724257],"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.0002722527,0.00006727273,0.0003467163,0.0001213453,0.00003751948,0.00008355746,0.00004075984,0.9857391,0.003328694,0.004318264,0.0003324049,0.005312107],"study_design_scores_gemma":[0.00003125768,0.0001718289,0.0004678578,0.000007101181,0.00001681307,0.00002444592,0.00003238975,0.9908346,0.001109062,0.007102634,0.0001922005,0.000009759237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5322053,0.0007479976,0.4596706,0.0005122384,0.0001028217,0.0001384566,0.0003991052,0.0002972923,0.005926232],"genre_scores_gemma":[0.961966,0.00029341,0.03551303,0.00003600305,0.00004311781,0.00005763596,0.0001054369,0.00007647811,0.001908924],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.004620441,"threshold_uncertainty_score":0.009187102,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01304066950757083,"score_gpt":0.1787178682763697,"score_spread":0.1656771987687989,"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."}}