{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007561716,0.001182476,0.001029789,0.0004576565,0.0007476777,0.001151601,0.00184198,0.0005291319,0.00341523],"category_scores_gemma":[0.002572179,0.0004212318,0.0008495608,0.001093804,0.0007424704,0.00126406,0.0008732333,0.0008846443,0.0004093424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001081704,"about_ca_system_score_gemma":0.001853096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002667631,"about_ca_topic_score_gemma":0.002999283,"domain_scores_codex":[0.9988533,0.0002437407,0.00005871406,0.0002766676,0.0003158465,0.0002516066],"domain_scores_gemma":[0.9986304,0.0006380393,0.0002379907,0.0002053787,0.0001403361,0.0001478287],"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.0003895844,0.0001311812,0.0003572529,0.0003602418,0.00003995615,0.000212025,0.0001070501,0.9064726,0.01499161,0.03997582,0.002022513,0.03494027],"study_design_scores_gemma":[0.00003187868,0.0001028213,0.000109402,0.000006498039,0.000006758129,0.00003558912,0.00001586212,0.9823429,0.002852825,0.01348187,0.001004373,0.000009242554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0806795,0.000306132,0.9087835,0.0002576621,0.00011716,0.0002057858,0.0003130104,0.001183562,0.00815365],"genre_scores_gemma":[0.8599837,0.0002966362,0.1361601,0.00005144068,0.00006586614,0.0002707464,0.0003808254,0.0001783347,0.002612362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00341523,"threshold_uncertainty_score":0.01142508,"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."}}