{"id":"W2961884489","doi":"10.1007/s40305-019-00256-x","title":"Online Scheduling with Unit Processing Times and Processing Set Restrictions","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Competitive analysis; Job shop scheduling; Scheduling (production processes); Computer science; Online algorithm; Set (abstract data type); Unit (ring theory); Algorithm; Combinatorics; Mathematical optimization; Mathematics; Schedule; Upper and lower bounds; 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.004388731,0.002066853,0.004699028,0.001095899,0.001289214,0.00290997,0.004493723,0.002328999,0.006121229],"category_scores_gemma":[0.01346372,0.001939502,0.001378716,0.003355841,0.001235546,0.005217318,0.00229352,0.003168351,0.0009819692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170412,"about_ca_system_score_gemma":0.003747414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003905396,"about_ca_topic_score_gemma":0.004021849,"domain_scores_codex":[0.9962998,0.001233874,0.0002405071,0.0007324468,0.0006955621,0.0007978686],"domain_scores_gemma":[0.9812899,0.01229478,0.001618709,0.002709,0.001208023,0.0008794568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001598275,0.0007202484,0.000749485,0.0003473887,0.0001263477,0.000527799,0.000088713,0.9078804,0.00431268,0.03136224,0.005047415,0.04723894],"study_design_scores_gemma":[0.00007086675,0.00008839255,0.0001407922,0.000006321678,0.00002481619,0.00004834887,0.00001193935,0.9873222,0.0007167172,0.0110838,0.0004749481,0.00001099331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1224516,0.000822242,0.8626944,0.0008690928,0.0005929567,0.0002801967,0.0007034941,0.001236637,0.01034935],"genre_scores_gemma":[0.8663548,0.0004150253,0.122861,0.0002862751,0.0006356467,0.0003521814,0.0005633605,0.0003304276,0.008201141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006121229,"threshold_uncertainty_score":0.02321011,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03202772653976704,"score_gpt":0.3227148121945191,"score_spread":0.290687085654752,"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."}}