{"id":"W3155015670","doi":"10.5267/j.ijiec.2021.3.002","title":"Two meta-heuristic algorithms for optimizing a multi-objective supply chain scheduling problem in an identical parallel machines environment","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Tardiness; Crossover; Computer science; Sorting; Particle swarm optimization; Genetic algorithm; Scheduling (production processes); Total cost; Multi-objective optimization; Algorithm; Job shop scheduling; Mathematics; Schedule; Artificial intelligence","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.0004487428,0.0002272869,0.0003957822,0.0004498239,0.00004716402,0.0001772751,0.0002757089,0.0001098791,0.00003659835],"category_scores_gemma":[0.0003606137,0.0002384624,0.0002246755,0.0002202816,0.00001971057,0.0003500401,0.00003989508,0.0004872063,0.000002386207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002482891,"about_ca_system_score_gemma":0.0001104935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009601856,"about_ca_topic_score_gemma":0.000004497057,"domain_scores_codex":[0.9982635,0.0000538909,0.0008759202,0.0001980234,0.0003744768,0.0002341251],"domain_scores_gemma":[0.9988731,0.0003343932,0.0001591734,0.00009586978,0.0003936735,0.0001437558],"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.00002231855,0.0001315244,0.0001423474,0.000008306568,0.0007498796,0.00007327586,0.0003223931,0.9951199,0.0003334299,0.0004821106,0.000007949063,0.002606593],"study_design_scores_gemma":[0.003178857,0.00005313077,0.000124461,0.0001046611,0.0001842861,0.0001278191,0.000166136,0.9951862,0.0004146514,0.0001958837,0.00004554668,0.0002184055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01624727,0.0004273003,0.9811266,0.0002915525,0.001576789,0.0001993448,0.00004788825,0.00007292488,0.00001034848],"genre_scores_gemma":[0.2264881,0.00003882382,0.7726372,0.00002035941,0.0006594993,0.00003732224,0.00006516882,0.00004378603,0.000009676685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2102409,"threshold_uncertainty_score":0.9724213,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04832974622145165,"score_gpt":0.2969558582867579,"score_spread":0.2486261120653062,"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."}}