{"id":"W4410711632","doi":"10.1016/j.ejor.2025.05.047","title":"A new class of lower bounds for scheduling a batch processing machine to minimize makespan","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Class (philosophy); Mathematical optimization; Flow shop scheduling; Parallel computing; Mathematics; Artificial intelligence; Embedded system; Routing (electronic design automation)","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.002481738,0.000102192,0.0001898335,0.0004974886,0.000146308,0.000195238,0.00031689,0.00002680043,0.00008699204],"category_scores_gemma":[0.0009359394,0.00009254308,0.00007874634,0.0006150989,0.00003167315,0.0001563654,0.00004716512,0.0003528114,0.00001201135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007885777,"about_ca_system_score_gemma":0.0004944618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001847901,"about_ca_topic_score_gemma":0.000001371901,"domain_scores_codex":[0.9984334,0.0001513647,0.0005422903,0.000122469,0.0005223437,0.0002281915],"domain_scores_gemma":[0.9982051,0.0002123353,0.00005078028,0.0001144148,0.001251018,0.0001663072],"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.0004504435,0.00007070135,0.0001342171,0.0001395645,0.0001048637,0.00002841802,0.000615932,0.9325445,0.008680298,0.001062953,0.007477702,0.04869038],"study_design_scores_gemma":[0.00281285,0.0005190551,0.00117136,0.0008888753,0.00002808922,0.00004171282,0.0004296232,0.9601859,0.005760815,0.0001755106,0.02774459,0.0002416275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01995024,0.0009608452,0.9694276,0.002745038,0.0003815696,0.0001940529,0.000009223931,0.00002253794,0.006308836],"genre_scores_gemma":[0.4380153,0.00002864839,0.5590953,0.0001159071,0.0003594667,0.000003135019,0.000005147265,0.00003447778,0.002342616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.418065,"threshold_uncertainty_score":0.3773797,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0434612803969374,"score_gpt":0.3455401924123342,"score_spread":0.3020789120153968,"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."}}