{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005056698,0.000695465,0.0006401961,0.0007734339,0.0004811339,0.0005592016,0.001257558,0.0008134693,0.00236292],"category_scores_gemma":[0.0007563802,0.0003055388,0.0006733808,0.0007260345,0.0003907461,0.0006860482,0.0007184059,0.0006702323,0.0005562286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004197079,"about_ca_system_score_gemma":0.0005849138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001601868,"about_ca_topic_score_gemma":0.001523244,"domain_scores_codex":[0.9995838,0.0001247491,0.00002068829,0.00008377105,0.0001477185,0.00003922124],"domain_scores_gemma":[0.9998009,0.00008406048,0.000017873,0.00003043711,0.0000494714,0.00001729329],"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.0001575735,0.0001285901,0.0005530199,0.0001228668,0.0001269769,0.0001364185,0.00009459351,0.7428286,0.01244567,0.02695534,0.002189885,0.2142604],"study_design_scores_gemma":[0.00002401509,0.00005291795,0.00009724852,0.000004502463,0.00001322304,0.000048923,0.000006635426,0.9922525,0.001296619,0.003638512,0.002555804,0.000009123494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01114985,0.000251652,0.9851643,0.00005383159,0.00007304603,0.00005674277,0.00002324254,0.0005303253,0.002696957],"genre_scores_gemma":[0.2543281,0.0002329413,0.7387913,0.0001100686,0.00004646859,0.0003022123,0.0001948703,0.0001544775,0.00583947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00236292,"threshold_uncertainty_score":0.007904708,"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."}}