{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002564115,0.0002145174,0.0002714561,0.0003140356,0.00008341143,0.0003358357,0.0002276016,0.000113528,0.00003719095],"category_scores_gemma":[0.0001510936,0.0002018723,0.00008751731,0.0001973379,0.00002878703,0.0006688487,0.00001320618,0.0003493104,0.000004512168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003156012,"about_ca_system_score_gemma":0.0002227983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005784764,"about_ca_topic_score_gemma":0.000007745276,"domain_scores_codex":[0.9986162,0.00002785065,0.0005937102,0.0001494841,0.0004125711,0.000200253],"domain_scores_gemma":[0.9975826,0.0002562499,0.0002093471,0.00008089418,0.001723181,0.000147684],"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.00002466282,0.0000451808,0.00007054205,0.000005345805,0.0003021895,0.000007748336,0.0003652922,0.9877825,0.0005162212,0.000646966,0.00007337219,0.01015999],"study_design_scores_gemma":[0.002702381,0.0002079665,0.00009566666,0.0001841134,0.00003872239,0.0001448832,0.0002699968,0.9952145,0.0005815864,0.0001782334,0.0001508748,0.0002310574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01809594,0.00007933675,0.9791476,0.0002653829,0.001715836,0.0003958754,0.0000588621,0.0001563699,0.00008482393],"genre_scores_gemma":[0.4094534,0.000009864401,0.5892723,0.00003055922,0.001071882,0.0000403647,0.00007373242,0.0000420417,0.000005868756],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3913575,"threshold_uncertainty_score":0.8232114,"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."}}