{"id":"W1972249265","doi":"10.1016/j.ejor.2015.01.003","title":"Single machine scheduling with two competing agents and equal job processing times","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Time complexity; Computer science; Scheduling (production processes); Job shop scheduling; Single-machine scheduling; Computational complexity theory; Mathematical optimization; Set (abstract data type); Algorithm; Mathematics; Schedule","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.003092704,0.00009603538,0.0001232228,0.0002090127,0.0001764282,0.000338597,0.0001554015,0.0000124345,0.00004328627],"category_scores_gemma":[0.0003530555,0.00007557228,0.00001681155,0.0002433261,0.00007538907,0.0003284469,0.00004739056,0.0004425344,0.0000232183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000621775,"about_ca_system_score_gemma":0.0001287498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001598307,"about_ca_topic_score_gemma":0.000001100292,"domain_scores_codex":[0.9983476,0.0003080363,0.0003029527,0.0001015997,0.0007386584,0.0002011266],"domain_scores_gemma":[0.9986687,0.00008949144,0.00004890404,0.00006341104,0.0009006996,0.0002287371],"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.00007177105,0.00004183739,0.001784692,0.00002626643,0.00004144469,0.0001711112,0.001393426,0.9814942,0.000999661,0.0001931769,0.0002809942,0.01350137],"study_design_scores_gemma":[0.001782362,0.0003603985,0.0007607002,0.0002544739,0.000008683724,0.0003676832,0.0008916309,0.993565,0.0006201764,0.00002759917,0.00120278,0.0001584685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7541349,0.002860553,0.2090489,0.0008938391,0.000222012,0.0001471499,0.000004798132,0.00008144247,0.03260646],"genre_scores_gemma":[0.8316604,0.00001861466,0.1677882,0.00003439964,0.0003251946,4.506359e-7,0.000004368651,0.00003472353,0.000133713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0775255,"threshold_uncertainty_score":0.3265099,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1016540663951278,"score_gpt":0.3421405488960593,"score_spread":0.2404864825009315,"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."}}