{"id":"W2162870855","doi":"10.1287/moor.26.1.31.10590","title":"A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Multiprocessor scheduling; Preemption; Time complexity; Multiprocessing; Algorithm; Scheduling (production processes); Job shop scheduling; Parallel computing; Schedule; Mathematics; Flow shop scheduling; Mathematical optimization; Operating system","routes":{"ca_aff":true,"ca_fund":false,"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.001364638,0.001465114,0.001250729,0.00093006,0.001359238,0.001763166,0.002506339,0.001736136,0.01467536],"category_scores_gemma":[0.00394532,0.0006427492,0.001300347,0.001965653,0.0009598936,0.002702996,0.002326063,0.002606386,0.003974221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002777733,"about_ca_system_score_gemma":0.003010439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003776251,"about_ca_topic_score_gemma":0.003916261,"domain_scores_codex":[0.9983835,0.0003274528,0.00009323785,0.0004218563,0.0003848022,0.0003891908],"domain_scores_gemma":[0.9985221,0.0007163525,0.0001017032,0.0003408894,0.0001737261,0.0001453234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009500939,0.0007762609,0.0007346646,0.0007174599,0.0001220442,0.0002639146,0.0004824076,0.2082833,0.01145457,0.1983517,0.04136059,0.536503],"study_design_scores_gemma":[0.0009958777,0.0002735256,0.0003358947,0.0000572779,0.00003990741,0.0001930445,0.00008796539,0.7589394,0.003457393,0.2086332,0.02692678,0.00005967229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01219198,0.0004904136,0.9663579,0.0009426411,0.000137763,0.0003678477,0.0004269707,0.00510444,0.01398005],"genre_scores_gemma":[0.1293215,0.000215148,0.8602465,0.000255656,0.00007445145,0.000457862,0.0009956443,0.000568245,0.007864946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01467536,"threshold_uncertainty_score":0.04909396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05539017173752653,"score_gpt":0.354648109459684,"score_spread":0.2992579377221575,"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."}}