{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01167914,0.005876635,0.003965701,0.005486732,0.001628779,0.007298914,0.00594232,0.003331113,0.007393931],"category_scores_gemma":[0.03182227,0.001974277,0.003726413,0.004931279,0.00199558,0.008255743,0.004318477,0.01048579,0.002138752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003566936,"about_ca_system_score_gemma":0.002531464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002350433,"about_ca_topic_score_gemma":0.00221931,"domain_scores_codex":[0.9904549,0.002159692,0.0005338974,0.001300974,0.004529005,0.001021503],"domain_scores_gemma":[0.9769911,0.01623084,0.001605646,0.001921994,0.002576218,0.0006741729],"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.0009419034,0.0004253489,0.0009608737,0.001262579,0.0004877907,0.0002102676,0.0002543687,0.5868696,0.01242562,0.1907978,0.02879561,0.1765683],"study_design_scores_gemma":[0.00004331009,0.0001771605,0.0002764529,0.0001189042,0.00007393507,0.00009549422,0.00001642918,0.9402539,0.001945362,0.04946941,0.007482472,0.00004707713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003758262,0.002945987,0.9829638,0.0006043312,0.0006996266,0.00008764121,0.0003152619,0.0006132108,0.008011973],"genre_scores_gemma":[0.2930723,0.008777304,0.6651516,0.002690491,0.005354006,0.001558866,0.002723176,0.002904643,0.01776753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01167914,"threshold_uncertainty_score":0.06176597,"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."}}