{"id":"W2002100181","doi":"10.1016/j.cor.2011.12.017","title":"A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Tardiness; Crossover; Computer science; Mathematical optimization; Algorithm; Scheduling (production processes); Genetic algorithm; Ant colony optimization algorithms; Job shop scheduling; Sequence (biology); Mathematics; Artificial intelligence; 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":[],"consensus_categories":[],"category_scores_codex":[0.0004764881,0.000162988,0.0001369922,0.0001871334,0.0006106515,0.0003000476,0.0004190728,0.00004526624,0.00008773957],"category_scores_gemma":[0.0000235244,0.0001178018,0.00004223958,0.000337234,0.0001293076,0.0001596498,0.00007667184,0.0003278895,0.00004734028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001001954,"about_ca_system_score_gemma":0.0001019863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009217722,"about_ca_topic_score_gemma":0.00003253483,"domain_scores_codex":[0.998617,0.0000762753,0.0002323824,0.0002826349,0.0003649431,0.0004267732],"domain_scores_gemma":[0.9989353,0.0001684228,0.00001145182,0.0003674031,0.0004038351,0.0001136141],"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.000006124125,0.00005207462,0.00001009719,0.00001692468,0.0000736221,0.000009021013,0.0006806498,0.9078786,0.0001403499,0.0001569913,0.0002049278,0.09077061],"study_design_scores_gemma":[0.0004119521,0.0001711514,0.00002128581,0.00003940044,0.00001438219,0.00004828922,0.0001471976,0.9955146,0.003104009,0.00007586474,0.0002859361,0.0001659411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003036894,0.0006557222,0.9943653,0.0001998707,0.0001973292,0.0008675657,0.0000349996,0.0002396609,0.0004026861],"genre_scores_gemma":[0.09830044,0.00007597317,0.9006853,0.00004103524,0.0001589205,0.0003043504,0.00004509206,0.00005546255,0.0003334915],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09526355,"threshold_uncertainty_score":0.4803817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07325806510702272,"score_gpt":0.2973903180443608,"score_spread":0.2241322529373381,"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."}}