{"id":"W2023874278","doi":"10.1016/j.ejor.2010.02.026","title":"A unified approach for scheduling with convex resource consumption functions using positional penalties","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tardiness; Job shop scheduling; Mathematical optimization; Subroutine; Computer science; Scheduling (production processes); Time complexity; Deadline-monotonic scheduling; Assignment problem; Convex function; Regular polygon; Algorithm; Mathematics; Flow shop scheduling","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.002301948,0.001776337,0.002294972,0.001042207,0.001044068,0.002216911,0.003006406,0.001425179,0.003890376],"category_scores_gemma":[0.004095339,0.001161916,0.001340387,0.002264715,0.001161066,0.002805568,0.002897862,0.003057391,0.0008363744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001922603,"about_ca_system_score_gemma":0.003549754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004113157,"about_ca_topic_score_gemma":0.006740695,"domain_scores_codex":[0.9983566,0.0004823914,0.00007790349,0.0001945099,0.0006696715,0.0002188336],"domain_scores_gemma":[0.99882,0.0004912511,0.00009110799,0.0002084612,0.0002768449,0.0001123914],"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.00005472082,0.00007285315,0.0001058051,0.00007171546,0.00003642267,0.0000601345,0.00007255923,0.8491412,0.002328888,0.1142691,0.001579511,0.03220706],"study_design_scores_gemma":[0.000005031505,0.00001385746,0.00001666262,0.000003296539,0.000005580252,0.000006920722,0.000005458804,0.9870908,0.0002224144,0.01201604,0.0006089234,0.000004972265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001405055,0.0000750117,0.9974087,0.00005645961,0.0000344777,0.00002190264,0.00001330871,0.0000642609,0.0009208805],"genre_scores_gemma":[0.1792125,0.0006581818,0.8119874,0.0002198957,0.0002294577,0.0003899453,0.000170696,0.0004760537,0.006655908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004113157,"threshold_uncertainty_score":0.01394957,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0885473385718951,"score_gpt":0.3211434306441951,"score_spread":0.2325960920723,"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."}}