{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03990254,0.0004671646,0.0007332655,0.000729523,0.001014401,0.001507396,0.00380971,0.0005379793,0.0004334458],"category_scores_gemma":[0.01415008,0.0004354058,0.000650397,0.0011313,0.000417266,0.000255261,0.002331656,0.001150356,0.0004098968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001274003,"about_ca_system_score_gemma":0.001110412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001525901,"about_ca_topic_score_gemma":0.0009626339,"domain_scores_codex":[0.9886422,0.005934899,0.001334346,0.001757599,0.001495157,0.0008357644],"domain_scores_gemma":[0.9778554,0.007853328,0.0008590537,0.004118264,0.008894427,0.0004195249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009676773,0.001585306,0.01149225,0.0003383059,0.0004340546,0.000007325442,0.03321942,0.004798763,0.003058,0.8001521,0.00705329,0.1377644],"study_design_scores_gemma":[0.002795606,0.000003428818,0.008401113,0.004804642,0.000373061,0.00004065723,0.00155071,0.2620377,0.06909668,0.5848919,0.06337915,0.002625437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1026244,0.001601704,0.8050911,0.01115046,0.000664077,0.001232831,0.0001809963,0.0004228055,0.07703158],"genre_scores_gemma":[0.5195944,0.0001511885,0.4546012,0.00009653805,0.00008039836,0.0002578122,0.0001547548,0.00007161159,0.02499208],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.41697,"threshold_uncertainty_score":0.9998098,"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."}}