{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007941237,0.0002471474,0.0003488471,0.0006095406,0.0001797835,0.0001876074,0.0001792987,0.00004762613,0.0000159836],"category_scores_gemma":[0.0001441878,0.0001989103,0.0001044471,0.0009178296,0.00003095246,0.0001294005,0.0001018664,0.000195807,0.00005124728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001539068,"about_ca_system_score_gemma":0.00003554527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001692845,"about_ca_topic_score_gemma":0.000004853343,"domain_scores_codex":[0.9985034,0.00007191505,0.0005073352,0.000256833,0.00030802,0.0003524268],"domain_scores_gemma":[0.9989619,0.0002195727,0.0001389869,0.000162923,0.0003944089,0.0001221973],"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.0003148687,0.0000758665,0.00004330836,0.0002265247,0.0008292271,0.00006945854,0.003428784,0.9665599,0.0007607405,0.00006847252,0.001172121,0.02645071],"study_design_scores_gemma":[0.00235097,0.0002553383,0.0009597425,0.0001835801,0.0001342219,0.00004640104,0.002927624,0.9921722,0.000224292,0.00001424836,0.0004773939,0.0002540041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03784855,0.00009035186,0.9580333,0.0002175023,0.000891751,0.002375076,0.00009054706,0.0002039288,0.0002490146],"genre_scores_gemma":[0.01853104,0.00003670504,0.9795727,0.00009445215,0.0002704484,0.0002033965,0.00002062839,0.00006816021,0.001202455],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02619671,"threshold_uncertainty_score":0.8111327,"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."}}