{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00261766,0.0001077197,0.0001319411,0.000341741,0.0004357203,0.0002343992,0.0001703418,0.00003536111,0.0001302791],"category_scores_gemma":[0.0002387495,0.000090658,0.00005578048,0.0002232481,0.0001492791,0.000267213,0.00002048945,0.0007754284,0.00001551694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005177326,"about_ca_system_score_gemma":0.0001836641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.735474e-7,"about_ca_topic_score_gemma":6.680937e-7,"domain_scores_codex":[0.9984746,0.000213045,0.0003471814,0.0001276447,0.0006175949,0.0002199603],"domain_scores_gemma":[0.9981852,0.0002364463,0.00006174943,0.0001123974,0.001257091,0.0001471392],"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.0001584468,0.00004400005,0.0002695789,0.00003340604,0.00007676442,0.00001145651,0.0002016619,0.9807443,0.01601423,0.001622684,0.0004329151,0.0003905498],"study_design_scores_gemma":[0.001343577,0.0002063324,0.0012872,0.00006188943,0.0000222681,0.0004602399,0.0005532403,0.9931847,0.001012724,0.00002154025,0.001682239,0.0001640567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3082182,0.0001143437,0.6883522,0.000170859,0.0001775195,0.0001725646,0.00001902374,0.00003280455,0.002742415],"genre_scores_gemma":[0.562856,0.000008131477,0.4362004,0.00002715931,0.000605683,0.000004194751,0.00005298945,0.00003772049,0.0002078252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2546377,"threshold_uncertainty_score":0.3696926,"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."}}