{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000177561,0.0002383595,0.0003169634,0.0002299847,0.00004372924,0.0001188444,0.0001440064,0.0002119777,0.00005878984],"category_scores_gemma":[0.000110882,0.000313737,0.000082249,0.0006382279,0.0000121021,0.000173945,0.00006675437,0.0005075186,0.00005003409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001730195,"about_ca_system_score_gemma":0.00004755377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004950773,"about_ca_topic_score_gemma":5.42667e-7,"domain_scores_codex":[0.9987263,0.00002756639,0.000397044,0.0002747243,0.0001848905,0.0003894858],"domain_scores_gemma":[0.9994679,0.0001206173,0.00002780106,0.0002077223,0.00004989088,0.0001260533],"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.00000344671,0.00001205705,0.00009670621,0.00001786125,0.00002914932,0.00004263,0.0001239055,0.9897314,0.005664527,0.00004821276,0.0001302103,0.004099899],"study_design_scores_gemma":[0.0009613785,0.00001059074,0.0003885965,0.0002232946,0.00000992941,0.00004738219,0.00004032657,0.9932306,0.004404859,0.000002577509,0.000356499,0.0003239457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7104747,0.0004693487,0.2833355,0.0001285777,0.004088342,0.0001672142,0.000007717373,0.0009665022,0.0003621474],"genre_scores_gemma":[0.7414796,0.00002490918,0.256387,0.0000480655,0.001697264,0.00001957386,0.0001031409,0.0001255088,0.0001149137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.031005,"threshold_uncertainty_score":0.9999315,"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."}}