{"id":"W2502805255","doi":"10.1016/j.ejor.2017.03.002","title":"Shared multi-processor scheduling","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Parallel computing; Job shop scheduling; Processor scheduling; Time complexity; Distributed computing; Mathematical optimization; Algorithm; Mathematics; Operating system; 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":[],"consensus_categories":[],"category_scores_codex":[0.002962144,0.00008098547,0.0001111589,0.0001836308,0.00060392,0.0007206923,0.0006516522,0.00002046606,0.0001918317],"category_scores_gemma":[0.001597923,0.00007081174,0.00005148941,0.00008277038,0.0000825231,0.0005283399,0.0000702224,0.0005405047,0.0002208046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004459091,"about_ca_system_score_gemma":0.00009824845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.815694e-7,"about_ca_topic_score_gemma":7.042493e-7,"domain_scores_codex":[0.9986156,0.000166129,0.0003269091,0.00009356795,0.0006038488,0.0001939658],"domain_scores_gemma":[0.9984236,0.00006884801,0.00007231283,0.0002180478,0.00106328,0.0001538588],"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.00005662311,0.0001001558,0.001241724,0.00005365966,0.0001234242,0.0004089641,0.0008043728,0.9692488,0.007712559,0.000804686,0.002758273,0.01668673],"study_design_scores_gemma":[0.001851405,0.0001317728,0.02073257,0.0002147872,0.000007719183,0.0001147254,0.0002762953,0.9697558,0.003124429,0.0000430527,0.003525469,0.000221982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3826043,0.002763226,0.5376782,0.004581043,0.0025392,0.0003537721,0.00003326842,0.0001709875,0.06927603],"genre_scores_gemma":[0.8015265,0.00008576034,0.197139,0.00002357052,0.0006170201,9.426647e-7,0.000003444135,0.00003399911,0.0005697918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4189222,"threshold_uncertainty_score":0.6949653,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1377006751893111,"score_gpt":0.3782294269064823,"score_spread":0.2405287517171712,"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."}}