{"id":"W4401632632","doi":"10.1007/s10878-024-01203-0","title":"The prize-collecting single machine scheduling with bounds and penalties","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Job shop scheduling; Theory of computation; Scheduling (production processes); Single-machine scheduling; Computer science; Mathematical optimization; Upper and lower bounds; Due date; Schedule; Time complexity; Polynomial-time approximation scheme; Mathematics; Algorithm","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.006378298,0.001658769,0.003301029,0.001603178,0.001941298,0.003338087,0.004907669,0.00208554,0.007004127],"category_scores_gemma":[0.01868849,0.001260345,0.001290401,0.003197549,0.002836042,0.004484496,0.002955215,0.003987337,0.0008790445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00192758,"about_ca_system_score_gemma":0.003816908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001685915,"about_ca_topic_score_gemma":0.001963492,"domain_scores_codex":[0.9960055,0.002300344,0.0001191278,0.000543894,0.0005755848,0.00045563],"domain_scores_gemma":[0.9902334,0.005786913,0.0005458134,0.00150969,0.0009247394,0.0009993993],"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.001013043,0.0002687612,0.0005560181,0.0004175382,0.0001096014,0.0000995131,0.0001666134,0.5681757,0.001674583,0.3352087,0.0187517,0.07355818],"study_design_scores_gemma":[0.00004175398,0.0001149184,0.0001690927,0.00002977476,0.00002404961,0.00004085979,0.00001756498,0.7950158,0.0005874407,0.2020243,0.001910032,0.00002441874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04296703,0.001216453,0.9315467,0.002278746,0.0006258546,0.0001993535,0.0004184432,0.000574691,0.0201727],"genre_scores_gemma":[0.6992865,0.001095793,0.2733151,0.0004987483,0.0008302631,0.0003140445,0.000328411,0.0005292345,0.02380189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007004127,"threshold_uncertainty_score":0.03373206,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007748863312687487,"score_gpt":0.2141112480245763,"score_spread":0.2063623847118888,"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."}}