{"id":"W4399007214","doi":"10.1016/j.cor.2024.106708","title":"Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Engineering and Physical Sciences Research Council; Loughborough University; University of Nottingham; University of Bath","keywords":"Job shop scheduling; Metaheuristic; Computer science; Mathematical optimization; Scheduling (production processes); Algorithm; Variable neighborhood search; Time complexity; Computational complexity theory; Flow shop scheduling; Batch processing; Mathematics; 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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007083552,0.0001482872,0.000140293,0.0002594564,0.00045919,0.001537609,0.0002813263,0.00006792935,0.00001953364],"category_scores_gemma":[0.00002763884,0.0001103854,0.00003388427,0.0007994375,0.00009331926,0.000294824,0.0001482867,0.0004364031,0.00007143868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000056336,"about_ca_system_score_gemma":0.00009009214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003764408,"about_ca_topic_score_gemma":0.00001576934,"domain_scores_codex":[0.9985901,0.00007136818,0.0002529988,0.0003259393,0.0003973946,0.0003622262],"domain_scores_gemma":[0.9992522,0.0001600872,0.000003112977,0.0002250979,0.0001998134,0.0001597037],"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.000002784103,0.00001313388,0.000009146568,0.00007550276,0.00002297609,0.000009390214,0.002073905,0.946049,0.00005678189,0.0007393604,0.002018566,0.04892949],"study_design_scores_gemma":[0.0001345414,0.00002033344,0.00006931677,0.0001296586,0.000006797853,0.00002186094,0.0001888027,0.9984471,0.00004009262,0.0002546636,0.0005491868,0.0001376348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004245079,0.001325602,0.9881686,0.004639687,0.0002903528,0.0004898274,0.000005936524,0.0002751036,0.0005598158],"genre_scores_gemma":[0.1782151,0.0001788493,0.8196754,0.0001275586,0.0003820408,0.0002578673,0.0000222243,0.0000601238,0.001080899],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.17397,"threshold_uncertainty_score":0.9994989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04882901229931565,"score_gpt":0.3428373323546365,"score_spread":0.2940083200553209,"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."}}