{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004554691,0.0001210386,0.0001533759,0.0001388193,0.0002340286,0.0005991283,0.0000914039,0.00005980904,0.000008783563],"category_scores_gemma":[0.000136623,0.00008034847,0.00004003747,0.0003864394,0.00004264051,0.0003436603,0.00001343183,0.0002715624,7.156029e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008428474,"about_ca_system_score_gemma":0.00006681377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001358406,"about_ca_topic_score_gemma":5.180418e-7,"domain_scores_codex":[0.999157,0.00003475485,0.0003388157,0.00007802744,0.0002531372,0.0001382298],"domain_scores_gemma":[0.9993373,0.000225188,0.00009392702,0.00007003397,0.0002094544,0.00006406458],"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.00004268333,0.00001223768,0.00003625252,0.00003311436,0.00007993102,0.000007898267,0.0003185321,0.9964574,0.00006414352,0.001242547,0.00005826939,0.001646999],"study_design_scores_gemma":[0.00062309,0.0001835116,0.000006298268,0.0001618915,0.0000513753,0.0001157399,0.0001576859,0.9967698,0.0005000515,0.000510839,0.0008089401,0.0001108024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02262809,0.01146546,0.9549404,0.0005815507,0.008722746,0.0001663182,0.000001625067,0.0002524597,0.001241365],"genre_scores_gemma":[0.7187186,0.001035435,0.2792248,0.00001473833,0.0008293933,0.000003564067,0.000003341598,0.00006563699,0.0001044514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6960906,"threshold_uncertainty_score":0.5777408,"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."}}