{"id":"W2087681531","doi":"10.1016/j.dam.2010.02.010","title":"Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Scheduling (production processes); Mathematical optimization; Due date; Job shop scheduling; Mathematics; Computer science; Time complexity; Assignment problem; Algorithm; Schedule","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.002014847,0.00115968,0.001965474,0.001237699,0.0008759112,0.001567929,0.001580102,0.001146654,0.004768546],"category_scores_gemma":[0.004716788,0.0005928947,0.0007244915,0.002540387,0.0007608262,0.001399203,0.001132271,0.001266359,0.0006002791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009515996,"about_ca_system_score_gemma":0.00126599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002748871,"about_ca_topic_score_gemma":0.00316292,"domain_scores_codex":[0.9989784,0.0004606919,0.00004839675,0.0001560049,0.0001751465,0.0001813779],"domain_scores_gemma":[0.9982509,0.001089743,0.0002127058,0.0000966409,0.0002271511,0.0001229214],"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.0008264413,0.0003257456,0.0007374774,0.0003824348,0.0001085748,0.0001519582,0.0002506416,0.8408361,0.003580578,0.07959206,0.005357488,0.0678505],"study_design_scores_gemma":[0.00008228973,0.0002452303,0.000489129,0.00004369854,0.00003787987,0.0001087199,0.0001071234,0.9589895,0.001804845,0.03526886,0.002796532,0.00002609837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1057563,0.001706378,0.8765018,0.0005463762,0.0001730538,0.0002805602,0.0003753475,0.0003093999,0.01435078],"genre_scores_gemma":[0.658499,0.00135354,0.3209676,0.0002721467,0.0001162749,0.0005338622,0.0006137384,0.0003794896,0.01726438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004768546,"threshold_uncertainty_score":0.01595241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009948922805564427,"score_gpt":0.2184411400504964,"score_spread":0.208492217244932,"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."}}