{"id":"W4389832522","doi":"10.5267/j.jpm.2023.9.001","title":"A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Job shop scheduling; Mathematical optimization; Initialization; Computer science; Scheduling (production processes); Idle; Greedy algorithm; Flow shop scheduling; Constructive; Algorithm; Mathematics; Schedule; Process (computing)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001597241,0.001398917,0.001236568,0.001217258,0.000552026,0.000754401,0.001833996,0.001620407,0.002005441],"category_scores_gemma":[0.00206994,0.0006687861,0.001362332,0.0008594008,0.0007279387,0.0008551222,0.001051279,0.001084397,0.000387209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007782618,"about_ca_system_score_gemma":0.002676508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0030152,"about_ca_topic_score_gemma":0.00375951,"domain_scores_codex":[0.9992131,0.0003262406,0.00003658454,0.0001091704,0.0002064837,0.0001084609],"domain_scores_gemma":[0.9992517,0.0004469807,0.00008774706,0.00004893454,0.0001156515,0.00004895756],"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.000113496,0.000190945,0.0004887124,0.0002228024,0.00009135178,0.000140915,0.0001161527,0.882651,0.006168766,0.010944,0.001231208,0.0976407],"study_design_scores_gemma":[0.00002964804,0.00008964867,0.00008916685,0.000012866,0.00001895013,0.00004054772,0.00001522885,0.9966179,0.001103936,0.001335306,0.0006349463,0.00001198852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008372772,0.000146039,0.9894809,0.00005639735,0.00003409186,0.0001305631,0.00001471113,0.0001828559,0.001581669],"genre_scores_gemma":[0.2017982,0.0001636471,0.7954387,0.00009840864,0.0000330902,0.0006077933,0.00007844174,0.00008137064,0.001700396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0030152,"threshold_uncertainty_score":0.008447111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02007630204829185,"score_gpt":0.2706051062433185,"score_spread":0.2505288041950267,"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."}}