{"id":"W4399385237","doi":"10.1080/16258312.2024.2332167","title":"Variable neighbourhood search for parallel machine scheduling with a single loading server: a truck-scheduling perspective","year":2024,"lang":"en","type":"article","venue":"Supply Chain Forum an International Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Metaheuristic; Truck; Solver; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Integer programming; Variable neighborhood search; Distributed computing; Artificial intelligence; Algorithm; Mathematics; Engineering; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005704341,0.0003041145,0.0002458167,0.0005264423,0.0002746372,0.001159925,0.000491053,0.0001254262,0.0003884396],"category_scores_gemma":[0.00006614674,0.0002762336,0.0001588299,0.0003365181,0.00004266765,0.001029528,0.00004878954,0.0006770855,0.00001749728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006187165,"about_ca_system_score_gemma":0.0001954347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005653247,"about_ca_topic_score_gemma":0.00002970645,"domain_scores_codex":[0.9980075,0.0000424477,0.0004102443,0.0003734537,0.0005938198,0.0005724838],"domain_scores_gemma":[0.9987947,0.0001365268,0.00005844586,0.0001623503,0.0005827328,0.0002652446],"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.0001588101,0.00008345783,0.0008406366,0.00004418337,0.0005953485,0.00008377615,0.001872645,0.9431874,0.0006491067,0.04982792,0.00004286845,0.002613903],"study_design_scores_gemma":[0.001388029,0.0002645141,0.00004606346,0.0003859324,0.00004576316,0.0007961806,0.003542483,0.9869057,0.001070744,0.004690839,0.000489219,0.0003745166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02744554,0.001491528,0.9644343,0.001921996,0.002192572,0.0002663543,0.0001179223,0.0004795947,0.001650193],"genre_scores_gemma":[0.6267784,0.00007513914,0.3715156,0.000122023,0.001098366,0.0000297436,0.00008525496,0.0001059308,0.0001896219],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5993328,"threshold_uncertainty_score":0.999969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01315461253671452,"score_gpt":0.2607738000780744,"score_spread":0.2476191875413599,"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."}}