{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001489708,0.00209429,0.001527596,0.002209223,0.0006996171,0.00166589,0.001754175,0.002703806,0.001837187],"category_scores_gemma":[0.003097545,0.0009546102,0.001789172,0.001930262,0.0007234025,0.0008160838,0.001064623,0.001859829,0.0003156141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001413073,"about_ca_system_score_gemma":0.002112102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004794118,"about_ca_topic_score_gemma":0.004684187,"domain_scores_codex":[0.9993623,0.000231564,0.00003887608,0.0000947732,0.0001701792,0.0001024151],"domain_scores_gemma":[0.9990898,0.0004958641,0.0001394094,0.00004983132,0.0001628183,0.00006218925],"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.0000473383,0.00006895148,0.0002782017,0.00007992747,0.00006993226,0.00006908727,0.00004755105,0.9669437,0.0005644646,0.004587383,0.000543236,0.02670016],"study_design_scores_gemma":[0.00002754349,0.00004796607,0.00009248904,0.0000156555,0.00002183192,0.00001878473,0.000014956,0.9977123,0.0003105747,0.001164913,0.0005663552,0.000006589894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0325352,0.001519136,0.955398,0.0004884541,0.0002413212,0.0003179818,0.0001342133,0.0003384386,0.009027332],"genre_scores_gemma":[0.3596143,0.001090529,0.6330242,0.0002493658,0.0001233346,0.001285082,0.0002703165,0.00009189687,0.00425106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004794118,"threshold_uncertainty_score":0.01025265,"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."}}