{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006663231,0.0001274556,0.0002034373,0.0002841425,0.0002484074,0.0001253964,0.0002253912,0.00006417224,0.00005859129],"category_scores_gemma":[0.0002448661,0.0001104422,0.00004217987,0.0005410277,0.00008896628,0.0001733396,0.00002802732,0.0002166478,0.00002414208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004870325,"about_ca_system_score_gemma":0.00009347979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001934677,"about_ca_topic_score_gemma":0.00004948974,"domain_scores_codex":[0.9987779,0.00002261019,0.0003201599,0.0001616074,0.000390432,0.0003272934],"domain_scores_gemma":[0.9986746,0.000245603,0.00001537407,0.000268872,0.0007061792,0.0000893707],"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.000009988034,0.000131131,0.00002417419,0.0001450771,0.00006244472,0.000002307926,0.001315805,0.98314,0.001445011,0.0004008238,0.0001540814,0.01316913],"study_design_scores_gemma":[0.0009360772,0.0000753096,0.000004504039,0.00007795708,0.00001061902,0.00001415133,0.0009978919,0.9919132,0.005615949,0.00003982594,0.0001815651,0.000132975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1098947,0.0001372084,0.8877811,0.0001196254,0.00006144333,0.0005921587,0.00002568504,0.0001290987,0.001258997],"genre_scores_gemma":[0.1330945,0.00005306656,0.8657876,0.000005342944,0.0001312355,0.0002130916,0.00001823664,0.00005148444,0.0006454467],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02319985,"threshold_uncertainty_score":0.4503704,"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."}}