{"id":"W2796934628","doi":"10.1016/j.cor.2018.04.004","title":"Tabu search and iterated local search for the cyclic bottleneck assignment problem","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Tabu search; Guided Local Search; Iterated local search; Mathematical optimization; Bottleneck; Solver; Local search (optimization); Block (permutation group theory); Benchmark (surveying); Metaheuristic; Hill climbing; Computer science; Algorithm; Mathematics; Job shop scheduling; Scheduling (production processes); Iterated function; Schedule; Combinatorics","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01368017,0.000162247,0.000230827,0.000633623,0.003911247,0.002438316,0.001245307,0.0001050014,0.0002064803],"category_scores_gemma":[0.0009615381,0.0001023279,0.0000866577,0.002227904,0.001532968,0.0003300446,0.000629662,0.0005576305,0.0006096527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001240239,"about_ca_system_score_gemma":0.0005952913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004464223,"about_ca_topic_score_gemma":0.0002892671,"domain_scores_codex":[0.9946166,0.001039917,0.000530589,0.0007960419,0.002136753,0.000880061],"domain_scores_gemma":[0.9909292,0.004732069,0.00001885856,0.0009463052,0.00307887,0.0002946463],"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.0002611889,0.0006508688,0.002558097,0.00003217002,0.0003033118,0.00001088074,0.01157069,0.4169377,0.007528282,0.0622019,0.08446468,0.4134802],"study_design_scores_gemma":[0.0005611586,0.0004124247,0.002112084,0.00003042497,0.000008887657,0.00001460362,0.001378616,0.9735604,0.002400253,0.0008870799,0.01848917,0.000144901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1211918,0.0004109473,0.8609363,0.01528523,0.0003326052,0.001261752,0.00003212216,0.00005555462,0.0004936525],"genre_scores_gemma":[0.9679331,0.00004396944,0.02737031,0.0002166288,0.000564425,0.0001984725,0.000016745,0.00002177368,0.003634611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8467413,"threshold_uncertainty_score":0.9985973,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3270447379013257,"score_gpt":0.5011930913327103,"score_spread":0.1741483534313846,"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."}}