{"id":"W2081396989","doi":"10.1016/j.ipl.2013.05.005","title":"The complexity of two supply chain scheduling problems","year":2013,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Beijing Postdoctoral Science Foundation","keywords":"Unary operation; Bottleneck; Scheduling (production processes); Computer science; Component (thermodynamics); Binary number; Supply chain; Job shop scheduling; Product (mathematics); Mathematical optimization; Mathematics; Combinatorics; Arithmetic; Business; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001907958,0.00009898306,0.00009081094,0.0000797301,0.0001826399,0.0002458441,0.0001591202,0.00002994085,0.00002359703],"category_scores_gemma":[0.00003299207,0.00007688625,0.00002831611,0.0002252557,0.0001395943,0.001186703,0.00001500399,0.000127405,0.00007070821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000297588,"about_ca_system_score_gemma":0.00001603094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002047217,"about_ca_topic_score_gemma":0.000001247184,"domain_scores_codex":[0.9991891,0.00001121365,0.0003843625,0.0000464519,0.0001863803,0.0001825408],"domain_scores_gemma":[0.9995688,0.00002710088,0.0001140099,0.0001178533,0.0001333028,0.00003897511],"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.000001224354,0.00000359575,0.0001932695,0.0001557016,0.00001207623,4.308888e-8,0.001920352,0.9462193,0.001062486,0.0004268898,0.0004167864,0.04958832],"study_design_scores_gemma":[0.0002605571,0.000003955141,0.0003756963,0.00006389352,0.000003667466,0.000002637164,0.0003031767,0.9963965,0.00171902,0.0003184357,0.0004434422,0.0001090001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.20019,0.0002197763,0.7914505,0.004836892,0.0004190209,0.0004252111,0.000005078867,0.0005934159,0.001860096],"genre_scores_gemma":[0.9166128,0.00001127338,0.08258799,0.0006539956,0.00004311716,0.00004544573,0.00002472476,0.00001192565,0.0000087119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7164228,"threshold_uncertainty_score":0.313533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01560448787905895,"score_gpt":0.2173835268507453,"score_spread":0.2017790389716864,"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."}}