{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00207805,0.0006402932,0.001349146,0.001541282,0.0008072013,0.001088979,0.001900167,0.001678719,0.00496565],"category_scores_gemma":[0.00846184,0.0006548414,0.0008722042,0.002335188,0.001111437,0.001510813,0.001061317,0.001392216,0.0004364727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001387368,"about_ca_system_score_gemma":0.002367335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01493352,"about_ca_topic_score_gemma":0.01264337,"domain_scores_codex":[0.9991515,0.0005048825,0.00002505606,0.000077704,0.0001416132,0.00009930014],"domain_scores_gemma":[0.9971324,0.002249026,0.0001867958,0.0001229063,0.0002264208,0.00008242318],"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.0001365344,0.0001012726,0.0002820573,0.0001314303,0.00004978527,0.00002698342,0.00007176732,0.9215979,0.0003524288,0.02154852,0.002361839,0.05333955],"study_design_scores_gemma":[0.00002170576,0.0000267879,0.00006763158,0.000008697771,0.000009063437,0.000005898681,0.00000994107,0.9889373,0.00007352184,0.0105265,0.0003079785,0.000004997692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1131026,0.003378511,0.8618511,0.0007709199,0.0001943326,0.0001919018,0.0002720071,0.0008163794,0.01942222],"genre_scores_gemma":[0.5933515,0.0009682428,0.3967723,0.0002076609,0.0001520923,0.0004518671,0.0004079225,0.0003072346,0.007381251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01493352,"threshold_uncertainty_score":0.02969319,"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."}}