{"id":"W2415635022","doi":"10.5267/j.ijiec.2016.2.004","title":"A hybrid algorithm for unrelated parallel machines scheduling","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Tardiness; Simulated annealing; Mathematical optimization; Job shop scheduling; Genetic algorithm; Computer science; Scheduling (production processes); Hybrid algorithm (constraint satisfaction); Algorithm; Due date; Mathematics; 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.0002254087,0.0001540186,0.0001960158,0.000389404,0.00003625033,0.0000726505,0.0002972239,0.00008568676,0.00002879034],"category_scores_gemma":[0.0003773104,0.0001247061,0.0001502378,0.0001236387,0.00001650914,0.0002559006,0.00001787804,0.0002008338,0.000007505369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001395109,"about_ca_system_score_gemma":0.00006623013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001514301,"about_ca_topic_score_gemma":1.20917e-7,"domain_scores_codex":[0.9988719,0.00001205342,0.0005708371,0.0000959712,0.0002815556,0.0001676389],"domain_scores_gemma":[0.998746,0.0003875317,0.0001392299,0.00006673429,0.0005524528,0.0001080983],"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.00001178983,0.00001750938,0.00002319235,0.000001942767,0.0002517609,0.00001119084,0.00002713969,0.8605183,0.0002620861,0.0002720425,0.0003058802,0.1382971],"study_design_scores_gemma":[0.002540166,0.00004639954,0.00002381086,0.0002048878,0.00002941228,0.0001308481,0.000009464778,0.9943662,0.0007268831,0.0003053386,0.001453924,0.0001627076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01221976,0.0001260137,0.9815621,0.0005919196,0.005144535,0.0001035108,0.00006568891,0.0001607562,0.00002575442],"genre_scores_gemma":[0.277395,0.00005951978,0.7200668,0.00003056916,0.002304805,0.00001271817,0.000026172,0.00005940751,0.00004504414],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2651753,"threshold_uncertainty_score":0.5085367,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02144603319970495,"score_gpt":0.2565881444881143,"score_spread":0.2351421112884093,"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."}}