{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002168503,0.001605138,0.002203523,0.001221548,0.000569178,0.001400863,0.001996004,0.001483375,0.00433091],"category_scores_gemma":[0.003580265,0.001324556,0.001090865,0.00147827,0.001145652,0.001143456,0.001256786,0.001583946,0.0008740337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127872,"about_ca_system_score_gemma":0.00191447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004694135,"about_ca_topic_score_gemma":0.00462531,"domain_scores_codex":[0.9986738,0.0005877445,0.00004997053,0.0002018319,0.0003193613,0.0001672514],"domain_scores_gemma":[0.9986168,0.0007528245,0.0001343223,0.00008651221,0.0003329893,0.00007655563],"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.0001769781,0.00009479172,0.0001526572,0.0001115151,0.00006418113,0.00004881284,0.00006622175,0.956935,0.002249329,0.01445312,0.001719312,0.02392805],"study_design_scores_gemma":[0.00001712357,0.00004608884,0.00004379676,0.00000684125,0.000006091463,0.00001384902,0.000008509364,0.9942591,0.0002575792,0.004964986,0.0003691014,0.00000674221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009029121,0.0001801109,0.9874047,0.0001206664,0.00005529264,0.00005813815,0.0000426003,0.0001285224,0.002980835],"genre_scores_gemma":[0.4106587,0.0005125335,0.5755313,0.0003535428,0.000143862,0.0005907558,0.0002820125,0.0004394506,0.01148787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004694135,"threshold_uncertainty_score":0.01448834,"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."}}