{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003494087,0.001605254,0.003493816,0.001255755,0.001527303,0.002416943,0.002903619,0.002899302,0.003432995],"category_scores_gemma":[0.008145416,0.001640524,0.001279714,0.00182529,0.001349792,0.002187892,0.001576889,0.001522301,0.0006777999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001169731,"about_ca_system_score_gemma":0.001431969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001772113,"about_ca_topic_score_gemma":0.001381031,"domain_scores_codex":[0.9973757,0.001039231,0.0001684439,0.0005207501,0.0004111521,0.0004846286],"domain_scores_gemma":[0.9929116,0.004420692,0.0007520546,0.0005964258,0.0005866091,0.0007325094],"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.001620172,0.000297522,0.0007251151,0.0002332504,0.0001379431,0.0004100105,0.00008983253,0.9650226,0.004993739,0.009631133,0.0009486107,0.01589011],"study_design_scores_gemma":[0.0001752888,0.0001917857,0.0002507359,0.000005529571,0.00003035715,0.0000615774,0.00002347761,0.9911358,0.001048921,0.006800357,0.0002563559,0.00001973517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.413831,0.0009547711,0.5749965,0.0008588295,0.0006550981,0.0003795697,0.000245744,0.0005238566,0.007554539],"genre_scores_gemma":[0.9088406,0.0001576436,0.08561166,0.00007264845,0.0001671877,0.0002216324,0.00008854247,0.00006668562,0.004773385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003494087,"threshold_uncertainty_score":0.01847869,"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."}}