{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002574879,0.00233859,0.003286239,0.001014574,0.0009218411,0.00225767,0.00350985,0.002843496,0.00403152],"category_scores_gemma":[0.003481786,0.001377569,0.001604764,0.00227711,0.00128027,0.002596821,0.001432344,0.002344441,0.0005807486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00228741,"about_ca_system_score_gemma":0.002735166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01125702,"about_ca_topic_score_gemma":0.008130632,"domain_scores_codex":[0.998478,0.0006294268,0.00005154567,0.0003351266,0.0002560712,0.0002498284],"domain_scores_gemma":[0.9985247,0.0009520794,0.0002343338,0.00005689394,0.0001345613,0.00009740199],"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.00002953771,0.00004815583,0.00008012591,0.00007527334,0.00003234941,0.00004526147,0.00001778569,0.9839749,0.000166222,0.01043979,0.0008088739,0.004281745],"study_design_scores_gemma":[0.00001223899,0.00002443408,0.000053987,0.000007067534,0.000007967421,0.00001101873,0.000008216101,0.9921591,0.00005724885,0.007171195,0.0004826733,0.00000489074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02599269,0.001308063,0.9593239,0.0008073325,0.0002152546,0.000298047,0.0004320179,0.0002651343,0.01135759],"genre_scores_gemma":[0.6540189,0.002589356,0.3159866,0.0003992381,0.0003593478,0.001461238,0.0008729718,0.0002868345,0.02402548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01125702,"threshold_uncertainty_score":0.02238297,"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."}}