{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200843,0.001855839,0.001349299,0.001204996,0.001227157,0.001559487,0.002159755,0.002321423,0.004755462],"category_scores_gemma":[0.004299118,0.0008695492,0.001098576,0.002048334,0.0008317331,0.003347963,0.001785704,0.002275733,0.001942659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268146,"about_ca_system_score_gemma":0.002803033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001978781,"about_ca_topic_score_gemma":0.002642651,"domain_scores_codex":[0.9989367,0.0002708101,0.00006502945,0.0002394442,0.0003424872,0.0001455351],"domain_scores_gemma":[0.9985709,0.0008235636,0.00008515787,0.0002036552,0.0002472738,0.00006948347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004681087,0.0002808211,0.0005495139,0.0004875388,0.000121726,0.0001729828,0.0001870121,0.2968154,0.009288555,0.05562349,0.01738229,0.6186226],"study_design_scores_gemma":[0.0004262489,0.0002314175,0.0003424065,0.00005411327,0.00004200535,0.0002216702,0.00004350197,0.8942625,0.004072484,0.08180749,0.0184498,0.0000463877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003663323,0.0003863051,0.9931324,0.0001820556,0.000108325,0.000109181,0.00009423488,0.0008906799,0.001433551],"genre_scores_gemma":[0.02893056,0.0002526096,0.9684547,0.00008022478,0.00007726673,0.0003416566,0.0003216691,0.0001401676,0.001401312],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004755462,"threshold_uncertainty_score":0.0159086,"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."}}