{"id":"W2798036437","doi":"10.1016/j.cie.2018.04.021","title":"Permutation flowshop scheduling with time lag constraints and makespan criterion","year":2018,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China; Natural Science Foundation of Beijing Municipality; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Job shop scheduling; Mathematical optimization; Scheduling (production processes); Benchmark (surveying); Minification; Permutation (music); Computer science; Heuristic; Integer programming; Time complexity; Schedule; Heuristics; Mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0001334415,0.0002136228,0.0001962781,0.0001662705,0.00007937093,0.0001356889,0.00009455472,0.0001508385,0.00004647229],"category_scores_gemma":[0.00004192499,0.0002214297,0.00002549677,0.0002570479,0.00008017059,0.0001803211,0.00002647868,0.000244065,0.00002933011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005343286,"about_ca_system_score_gemma":0.00002259409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002024767,"about_ca_topic_score_gemma":3.599814e-7,"domain_scores_codex":[0.9991473,0.00001252945,0.0002088222,0.00022473,0.000138318,0.0002683166],"domain_scores_gemma":[0.9995732,0.00006103817,0.00002600344,0.0001393908,0.00006620046,0.0001341977],"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.00001678007,0.000007300348,0.00006201948,0.000022563,0.0000643434,0.00001127598,0.0004455275,0.9590566,0.00286685,0.00009681967,0.00007937878,0.03727052],"study_design_scores_gemma":[0.0009025788,0.00008119701,0.00009525388,0.0001740404,0.00001995453,0.00004955849,0.00004213114,0.9961633,0.001873719,0.000003090216,0.0003175261,0.0002776426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4056039,0.00006651442,0.5920389,0.00005607812,0.001103694,0.0001626282,0.000005593702,0.0007671437,0.0001955598],"genre_scores_gemma":[0.8419191,0.000005495365,0.1566939,0.00003448776,0.001225194,0.000007823272,0.00002704816,0.00006448136,0.00002250936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4363152,"threshold_uncertainty_score":0.9029642,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01380998666727152,"score_gpt":0.2014354069919974,"score_spread":0.1876254203247259,"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."}}