{"id":"W1502375285","doi":"10.4230/lipics.stacs.2011.380","title":"A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times","year":2011,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; University of Waterloo","funders":"","keywords":"Preemption; Job shop scheduling; Computer science; Scheduling (production processes); Schedule; Algorithm; Processor scheduling; Computational complexity theory; Time complexity; Parallel computing; Mathematical optimization; Mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000594917,0.0009373976,0.0011736,0.0005144313,0.0002137261,0.0003039048,0.0008282456,0.0007103901,0.00002944666],"category_scores_gemma":[0.00007224226,0.0008301769,0.0003901828,0.0002867014,0.0001578302,0.0006593054,0.0003414806,0.001036242,0.00001518365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001496567,"about_ca_system_score_gemma":0.0002067516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002260828,"about_ca_topic_score_gemma":0.00001719684,"domain_scores_codex":[0.9962799,0.0000217607,0.001858285,0.0004391394,0.0004980948,0.0009028185],"domain_scores_gemma":[0.9971998,0.0000850599,0.0008945358,0.0007014358,0.0008629894,0.0002561464],"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.0001669265,0.0005781429,0.000541155,0.0168837,0.001256461,0.00000279875,0.02430689,0.8505085,0.00002910607,0.0002962681,0.0001150367,0.1053151],"study_design_scores_gemma":[0.003866293,0.0002232506,0.00001862504,0.001870385,0.0002272532,0.00002255159,0.0009539651,0.9896345,0.001369489,0.0001435969,0.0006838482,0.0009862671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003652792,0.0006148973,0.9883976,0.00001622637,0.0008780768,0.002848489,0.002250754,0.0006812837,0.0006598716],"genre_scores_gemma":[0.05168753,0.00009996754,0.9441253,0.00006245886,0.0001892293,0.0007827223,0.002610885,0.0002806455,0.0001612544],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.139126,"threshold_uncertainty_score":0.9994149,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02940853977823463,"score_gpt":0.2561213773527595,"score_spread":0.2267128375745249,"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."}}