{"id":"W2053052668","doi":"10.1007/s10951-007-0015-y","title":"Optimal due date assignment in multi-machine scheduling environments","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tardiness; Mathematical optimization; Computer science; Scheduling (production processes); Due date; Single-machine scheduling; Assignment problem; Time complexity; Job shop scheduling; Generalized assignment problem; Weapon target assignment problem; Function (biology); Mathematics; Algorithm; Schedule","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.004406516,0.001058435,0.002854781,0.001894336,0.001897103,0.003214438,0.002444596,0.001430784,0.004241247],"category_scores_gemma":[0.01170062,0.001408784,0.0006889018,0.003009013,0.001018551,0.003840157,0.002066494,0.001614962,0.0005398716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001826414,"about_ca_system_score_gemma":0.002354865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00207786,"about_ca_topic_score_gemma":0.002640768,"domain_scores_codex":[0.9974935,0.001113858,0.000136158,0.0003620746,0.000436628,0.0004578079],"domain_scores_gemma":[0.9950525,0.002930792,0.0004744355,0.0005189924,0.0005238206,0.0004994434],"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.0009165653,0.0002769835,0.000668858,0.0002245082,0.00006530546,0.0001353479,0.0001398693,0.8803926,0.002257451,0.05216678,0.004122194,0.05863356],"study_design_scores_gemma":[0.00008937249,0.00009976728,0.0002633097,0.0000137261,0.00001960364,0.00004416642,0.00003828154,0.956604,0.0009465114,0.04060598,0.001254191,0.00002104127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0769987,0.00152435,0.9131518,0.0007504453,0.0004669875,0.0001793291,0.000244562,0.0007236186,0.005960186],"genre_scores_gemma":[0.6965235,0.0008842255,0.2957364,0.0001619641,0.0002257797,0.0002006753,0.0003057504,0.0002945169,0.005667102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004406516,"threshold_uncertainty_score":0.02330416,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01833816959217388,"score_gpt":0.2556672366537828,"score_spread":0.2373290670616089,"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."}}