{"id":"W3160508408","doi":"10.1016/j.cie.2021.107387","title":"Minimizing total job completion time in MapReduce scheduling","year":2021,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Shaanxi Provincial Science and Technology Department; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Flow shop scheduling; Computer science; Job shop scheduling; Scheduling (production processes); Upper and lower bounds; Approximation algorithm; Mathematical optimization; Execution time; Generalization; Algorithm; Parallel computing; Mathematics; Schedule","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00139397,0.0006534707,0.001033005,0.0004650984,0.0007958869,0.0008913602,0.001214453,0.0004101533,0.0009724684],"category_scores_gemma":[0.002473171,0.0003342862,0.0004724541,0.0007054742,0.0003792251,0.0008097779,0.0006183332,0.0006052234,0.0001348819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008991825,"about_ca_system_score_gemma":0.002346377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007055837,"about_ca_topic_score_gemma":0.009054802,"domain_scores_codex":[0.9992884,0.0002204187,0.00002457077,0.00009889052,0.0001980118,0.000169763],"domain_scores_gemma":[0.9992576,0.000327389,0.00004766124,0.00008609702,0.0001738563,0.0001074564],"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.0007161187,0.0002396135,0.001152235,0.0002014232,0.00007815729,0.00008333538,0.00009087803,0.9149234,0.007739628,0.009775809,0.003736701,0.06126278],"study_design_scores_gemma":[0.00001629453,0.00009604879,0.0004382935,0.000003266856,0.00001652969,0.00002556329,0.00004105353,0.9906276,0.002196771,0.005931259,0.0006004605,0.000006769329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4015646,0.001278644,0.5833035,0.0008884196,0.000349113,0.0002332286,0.0003342556,0.0013076,0.01074072],"genre_scores_gemma":[0.9484625,0.000175443,0.04859085,0.00006251228,0.0000558673,0.00005504723,0.0001131137,0.000145005,0.002339607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007055837,"threshold_uncertainty_score":0.01402956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02015169645104698,"score_gpt":0.2030184781680407,"score_spread":0.1828667817169937,"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."}}