{"id":"W2051723428","doi":"10.5267/j.ijiec.2013.02.002","title":"An imperialist competitive algorithm for a bi-objective parallel machine scheduling problem with load balancing consideration","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Imperialist competitive algorithm; Mathematical optimization; Computer science; Scheduling (production processes); Load balancing (electrical power); Job shop scheduling; Algorithm; Mathematics; Optimization problem; Multi-swarm optimization; Schedule","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.001177137,0.0008998347,0.001267083,0.0008938842,0.000527918,0.0009978347,0.001341611,0.001376929,0.001391556],"category_scores_gemma":[0.002719205,0.0003031404,0.0006269137,0.001054624,0.0007195264,0.0008670458,0.0006423058,0.001030693,0.0002822159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007945475,"about_ca_system_score_gemma":0.001334254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004677163,"about_ca_topic_score_gemma":0.004043489,"domain_scores_codex":[0.9992083,0.0002640982,0.00003628478,0.00009449771,0.0003352044,0.00006168236],"domain_scores_gemma":[0.9990508,0.0005215402,0.00008069305,0.00004993969,0.000249525,0.00004744564],"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.00007989606,0.000072355,0.0004571407,0.0001494629,0.00009697722,0.0001068124,0.0001004441,0.8977845,0.002127956,0.01812676,0.002073675,0.0788239],"study_design_scores_gemma":[0.000009693487,0.00003067795,0.00005530697,0.000003286338,0.00000566915,0.00002392871,0.000005102179,0.9974662,0.0002316786,0.001190696,0.0009730226,0.000004684836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01578888,0.0007839659,0.9766772,0.000205671,0.0001054761,0.00009033414,0.0000262122,0.0001577535,0.006164567],"genre_scores_gemma":[0.4539618,0.0009109434,0.5384068,0.0001884504,0.0002118548,0.0004081627,0.0001529651,0.00009173825,0.005667327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004677163,"threshold_uncertainty_score":0.009299934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01238465732272886,"score_gpt":0.243074439820891,"score_spread":0.2306897824981621,"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."}}