{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002114272,0.0002339099,0.0002446626,0.0001438964,0.00003290283,0.00008557844,0.0001741852,0.0001774843,0.00009547335],"category_scores_gemma":[0.00001745291,0.000220148,0.00004674846,0.0001765804,0.00004179389,0.00008997598,0.00006875587,0.0004085524,0.00006410279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001005587,"about_ca_system_score_gemma":0.00001481642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002082004,"about_ca_topic_score_gemma":1.881797e-7,"domain_scores_codex":[0.9989635,0.00002246442,0.0002853888,0.0002383963,0.0001537445,0.0003364571],"domain_scores_gemma":[0.9994628,0.0001858593,0.00002652257,0.0002215793,0.000007059869,0.00009610916],"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.000005065454,0.000007721536,0.0001415089,0.00001132525,0.00003538879,0.000005592144,0.0002122679,0.9844658,0.000481924,0.00002772425,0.0000940437,0.01451168],"study_design_scores_gemma":[0.001216371,0.000021484,0.0002235951,0.00009815126,0.00001095616,0.00001697932,0.0001251029,0.9970885,0.0002069891,0.000007002659,0.0007292725,0.0002556151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7096192,0.0005425077,0.28353,0.0004825421,0.00370626,0.0009260417,0.00001603534,0.0006151168,0.0005622756],"genre_scores_gemma":[0.9531735,0.00004714078,0.04591763,0.0001005759,0.0005109819,0.00002374207,0.00002260955,0.0000964852,0.0001073407],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2435543,"threshold_uncertainty_score":0.8977374,"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."}}