{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002733138,0.001548776,0.002035556,0.001365254,0.001623114,0.002622783,0.002427235,0.00220155,0.004633748],"category_scores_gemma":[0.0159634,0.001023709,0.001378334,0.003497205,0.002140047,0.003420732,0.002059548,0.002512814,0.0003613774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503682,"about_ca_system_score_gemma":0.001317477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004984495,"about_ca_topic_score_gemma":0.005022205,"domain_scores_codex":[0.9985643,0.0005365124,0.00006433727,0.0001496079,0.0003272839,0.0003581302],"domain_scores_gemma":[0.9871902,0.01040147,0.0009133703,0.0004577011,0.000509313,0.0005280325],"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.0006707162,0.0004907792,0.001546179,0.0004457047,0.00008362978,0.001624063,0.0003482754,0.5429992,0.001631886,0.4080494,0.006574493,0.03553567],"study_design_scores_gemma":[0.0001054365,0.00006027251,0.0002528996,0.00001370019,0.00003013382,0.0002428345,0.0001170058,0.8697953,0.000394904,0.12797,0.0009997514,0.00001771382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2440321,0.00383479,0.7055122,0.002372473,0.0003112634,0.0001846541,0.0005588722,0.0003584287,0.04283521],"genre_scores_gemma":[0.9089556,0.002064246,0.07846623,0.0001019491,0.0004042768,0.000134884,0.0001839946,0.00009621298,0.009592608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004984495,"threshold_uncertainty_score":0.01550144,"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."}}