{"id":"W2029826506","doi":"10.1007/s10951-010-0208-7","title":"A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Function (biology); Single-machine scheduling; Due date; Regular polygon; Assignment problem; Time complexity; Resource consumption; Convex function; Job shop scheduling; Mathematics; 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.0005327994,0.0001664568,0.0003997525,0.0001062652,0.0001023521,0.000169597,0.0001657133,0.00009011823,0.00006144704],"category_scores_gemma":[0.0000987017,0.0001055225,0.00004803101,0.0002895067,0.00007243757,0.0002989759,0.00002474826,0.000404933,0.00000265552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001243925,"about_ca_system_score_gemma":0.00007704653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000580524,"about_ca_topic_score_gemma":3.916316e-7,"domain_scores_codex":[0.998933,0.00002642591,0.0004529777,0.0001209544,0.0002536397,0.0002130264],"domain_scores_gemma":[0.9990683,0.00009895252,0.0002043225,0.0001292117,0.00036229,0.000136938],"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.0005827683,0.0002624868,0.01120252,0.0005045858,0.0006718072,0.0000352817,0.004202373,0.835669,0.1400573,0.0004488675,0.0002933388,0.006069659],"study_design_scores_gemma":[0.002093378,0.00006703296,0.001446968,0.0002504441,0.0001330063,0.000791121,0.001974277,0.9753761,0.01736484,0.00007066707,0.0001591888,0.0002730023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8575115,0.0006608869,0.1396476,0.0002356804,0.0002968268,0.000151286,0.000003779835,0.00004407694,0.001448327],"genre_scores_gemma":[0.5607341,0.00001030994,0.438985,0.00002311064,0.0001561541,0.000003587013,8.858362e-7,0.0000228437,0.0000640487],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2993373,"threshold_uncertainty_score":0.4303081,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006204005759576244,"score_gpt":0.2150202417603225,"score_spread":0.2088162360007462,"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."}}