{"id":"W4415985875","doi":"10.1016/j.tcs.2025.115642","title":"Single machine controllable scheduling with bounded makespan","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Ningbo; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Job shop scheduling; Bounded function; Scheduling (production processes); Time complexity; Upper and lower bounds; Dynamic programming; Approximation algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0003681833,0.0001287081,0.0001545805,0.0001472808,0.0002157023,0.0002765595,0.0003732232,0.00003629101,0.00004997636],"category_scores_gemma":[0.00003806975,0.0001012701,0.00002243841,0.000918604,0.0009153375,0.0001332563,0.00007133855,0.0001432169,0.00002137784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005926646,"about_ca_system_score_gemma":0.00005228463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001226709,"about_ca_topic_score_gemma":9.158374e-7,"domain_scores_codex":[0.9990043,0.00001844769,0.0001483827,0.0002526998,0.0002392,0.0003369538],"domain_scores_gemma":[0.9994106,0.00009168984,0.00001320349,0.0002683207,0.000107306,0.0001088924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002176769,0.00003517417,0.00007404998,0.0000159992,0.00001543018,0.000004946237,0.00008216593,0.3711288,0.0009781881,0.6145296,0.00001178935,0.01310211],"study_design_scores_gemma":[0.0004534819,0.00005784057,0.00004067293,0.00004627914,0.000008902819,0.000006169632,0.000008733367,0.984728,0.006780719,0.007653898,0.00008243493,0.0001328346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03508252,0.0001097637,0.950044,0.000348375,0.0004156641,0.00009230508,0.000001040687,0.0004301161,0.01347622],"genre_scores_gemma":[0.6621849,0.000001682569,0.3375347,0.0002071364,0.00003421386,0.000002846292,8.600127e-7,0.000007563178,0.000026167],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6271024,"threshold_uncertainty_score":0.4129674,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005159755932363986,"score_gpt":0.2102154595493309,"score_spread":0.205055703616967,"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."}}