{"id":"W2735816152","doi":"","title":"Tabu Search for a Job Scheduling Problem","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Tabu search; Heuristics; Computer science; Graph coloring; Mathematical optimization; Scheduling (production processes); Integer programming; Variable neighborhood search; Generalization; Vertex (graph theory); Job shop scheduling; Heuristic; Graph; Algorithm; Theoretical computer science; Mathematics; Metaheuristic; Schedule","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.001705583,0.0007884341,0.001535944,0.001692282,0.001047954,0.001779797,0.001260133,0.0023779,0.01149209],"category_scores_gemma":[0.007678232,0.0007747281,0.00108676,0.003032359,0.0007836933,0.001326744,0.0006171516,0.00142813,0.001278284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00137141,"about_ca_system_score_gemma":0.002049905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006803197,"about_ca_topic_score_gemma":0.005195686,"domain_scores_codex":[0.9992244,0.0004048538,0.00002914989,0.0001057517,0.0001254027,0.0001103411],"domain_scores_gemma":[0.9972926,0.002261325,0.0001128587,0.0000969604,0.0001526289,0.00008369189],"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.0004005664,0.0002408684,0.0004942013,0.000531874,0.00009096613,0.00008255638,0.00008594008,0.8720675,0.001412817,0.01963953,0.01165514,0.09329808],"study_design_scores_gemma":[0.0001026363,0.0001000949,0.0002110253,0.00002928482,0.00002514013,0.00002899846,0.00003107087,0.972142,0.0003823751,0.02484107,0.002094875,0.00001140572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1942317,0.005264298,0.7558349,0.003041151,0.0006195258,0.0005989986,0.002769374,0.002434989,0.03520504],"genre_scores_gemma":[0.4627118,0.001704728,0.5155038,0.0004301561,0.0003420847,0.0007363374,0.001992156,0.0005231488,0.0160557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01149209,"threshold_uncertainty_score":0.03844494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1069670466216116,"score_gpt":0.3378819528293456,"score_spread":0.230914906207734,"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."}}