{"id":"W1551220477","doi":"10.1007/978-3-540-71615-0_21","title":"Crossover Operators for the Car Sequencing Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Crossover; Computer science; Operator (biology); Benchmark (surveying); Scheduling (production processes); Job shop scheduling; Mathematical optimization; Assembly line; Genetic algorithm; Artificial intelligence; Mathematics; Machine learning; Engineering; 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.0005377957,0.0008605927,0.0007381731,0.0006175119,0.0005761717,0.0006967374,0.0009939409,0.0008351297,0.006574743],"category_scores_gemma":[0.001195822,0.0002495807,0.0006954806,0.001240804,0.0005013348,0.0007993181,0.0006434565,0.001967729,0.0008430949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004921432,"about_ca_system_score_gemma":0.000465321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001424988,"about_ca_topic_score_gemma":0.00142356,"domain_scores_codex":[0.9997744,0.00006824607,0.000009955094,0.00003475256,0.00008262438,0.00002999357],"domain_scores_gemma":[0.999745,0.0001655213,0.00001377149,0.00002497515,0.00003538261,0.00001530978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000116227,0.0001509425,0.0002949696,0.0002725735,0.00004607598,0.0002556786,0.0002689202,0.2277545,0.009143753,0.2496264,0.01858605,0.4934838],"study_design_scores_gemma":[0.0001503703,0.0001705618,0.0008691601,0.000127447,0.00007148126,0.0005346543,0.00009584315,0.5514413,0.004689615,0.3983851,0.04341906,0.00004548307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01876753,0.001966351,0.9405177,0.0003770507,0.0002446403,0.00009313632,0.0001688837,0.0003732921,0.03749152],"genre_scores_gemma":[0.3031709,0.003768855,0.6311018,0.0003346005,0.0003680635,0.0003994887,0.0008969025,0.0006710016,0.05928825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006574743,"threshold_uncertainty_score":0.02199471,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01749189456774317,"score_gpt":0.244169847977615,"score_spread":0.2266779534098719,"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."}}