{"id":"W2397645628","doi":"10.1080/03155986.2001.11732429","title":"A Due-Window Determination In Minmax Scheduling Problems","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Tardiness; Mathematical optimization; Minimax; Scheduling (production processes); Computer science; Upper and lower bounds; Interval (graph theory); Due date; Schedule; Single-machine scheduling; Heuristic; Mathematics; Job shop scheduling; Algorithm; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342398,0.0001101911,0.0001333695,0.0006688593,0.0001874318,0.0005726563,0.0001043774,0.0001209896,0.00003258899],"category_scores_gemma":[0.000201716,0.0001057185,0.00001852935,0.0005991993,0.00003897803,0.002076399,0.00002854288,0.0002664353,0.0001261148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001250422,"about_ca_system_score_gemma":0.0000786088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009927247,"about_ca_topic_score_gemma":0.00002568296,"domain_scores_codex":[0.9984439,0.00004468164,0.0005503296,0.00008970685,0.0005937094,0.000277683],"domain_scores_gemma":[0.9991508,0.0001247512,0.00003423216,0.0001113745,0.0004845232,0.00009427773],"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.00001252794,0.00001053623,0.002660146,0.0001597917,0.000008646133,0.000002950051,0.002138478,0.9731268,0.00006053158,0.004784142,0.0001067393,0.01692867],"study_design_scores_gemma":[0.0005508023,0.00002553887,0.002436279,0.0001002596,9.157467e-7,0.00005090776,0.001160442,0.9820594,0.00005302904,0.00002872255,0.01340352,0.0001302079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7969826,0.001111538,0.1466463,0.000499103,0.0009526366,0.002224206,0.00004067643,0.0003845144,0.05115848],"genre_scores_gemma":[0.9934549,0.0002067939,0.005524201,0.00004971919,0.0001130367,0.0002336664,0.0001187388,0.00001151446,0.0002874453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1964723,"threshold_uncertainty_score":0.5522138,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04165794731630743,"score_gpt":0.3063424480025656,"score_spread":0.2646845006862582,"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."}}