{"id":"W1972282966","doi":"10.1007/s10951-007-0050-8","title":"Preemptive open shop scheduling with multiprocessors: polynomial cases and applications","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Multiprocessor scheduling; Rounding; Time complexity; Multiprocessing; Scheduling (production processes); Open shop; Integer programming; Job shop scheduling; Flow shop scheduling; Mathematical optimization; Mathematics; Algorithm; Schedule; Operating system","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.0007415228,0.0001850437,0.0002919058,0.0002331116,0.0001429629,0.0002085206,0.000303547,0.00009971079,0.00001543164],"category_scores_gemma":[0.000140865,0.0001573814,0.00004531259,0.0003436173,0.00006409266,0.0006048758,0.00005552491,0.0004025601,0.000004661895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006810766,"about_ca_system_score_gemma":0.00007858187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007405868,"about_ca_topic_score_gemma":0.00001273371,"domain_scores_codex":[0.9988127,0.00001371948,0.0005150331,0.0001579647,0.0002339891,0.0002665877],"domain_scores_gemma":[0.9988343,0.0002797144,0.0002254807,0.0001292074,0.0003042028,0.0002271669],"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.0003046867,0.0001003651,0.006934204,0.0001097881,0.000251679,0.0001109194,0.001165671,0.9610806,0.001966658,0.0001552023,0.00001922757,0.02780106],"study_design_scores_gemma":[0.01351806,0.001284908,0.006597307,0.002245696,0.0006886612,0.006346618,0.02841287,0.8745717,0.05988644,0.0002434215,0.003681944,0.002522391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4871176,0.00154747,0.5101523,0.00006382596,0.0001466827,0.0002354269,0.000003477131,0.00006614067,0.0006670653],"genre_scores_gemma":[0.5937425,0.00009165419,0.4056591,0.00003164973,0.0004185362,0.000004390206,0.000001572265,0.00003063079,0.00002000014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1066248,"threshold_uncertainty_score":0.6417828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01826334746394033,"score_gpt":0.2713019003888697,"score_spread":0.2530385529249294,"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."}}