{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005080362,0.001586282,0.002302334,0.0008455334,0.001269125,0.002604925,0.001778519,0.001271282,0.003594064],"category_scores_gemma":[0.01386293,0.001025018,0.001017575,0.001860168,0.001290927,0.004680973,0.001529947,0.002926529,0.000660202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001552424,"about_ca_system_score_gemma":0.001902095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001487877,"about_ca_topic_score_gemma":0.001320636,"domain_scores_codex":[0.9975356,0.001278183,0.0001288076,0.0004654669,0.0003529467,0.0002390413],"domain_scores_gemma":[0.9949389,0.003905942,0.0003876539,0.0003671875,0.0002295146,0.0001709148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009390371,0.0002404116,0.001635965,0.001012933,0.0001474858,0.0002525887,0.000354883,0.5274041,0.007437397,0.3173309,0.006209108,0.1370353],"study_design_scores_gemma":[0.00004581745,0.000196361,0.0006554737,0.00009012176,0.00003634122,0.0001692505,0.00008403749,0.797564,0.004237666,0.1881925,0.008683778,0.00004458101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01469968,0.002299053,0.9792928,0.0003597739,0.0002086621,0.0001111412,0.0001142889,0.0001733606,0.002741243],"genre_scores_gemma":[0.430586,0.003555228,0.5566176,0.0003314853,0.0009299094,0.0004829688,0.0004461631,0.00039731,0.006653325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005080362,"threshold_uncertainty_score":0.02686781,"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."}}