{"id":"W3188632549","doi":"10.1115/msec2021-60408","title":"A Dynamic Programming Approach to Solve the Facility Layout Problem for Reconfigurable Manufacturing","year":2021,"lang":"en","type":"article","venue":"Volume 2: Manufacturing Processes; Manufacturing Systems; Nano/Micro/Meso Manufacturing; Quality and Reliability","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Set (abstract data type); Heuristic; Dynamic programming; Mathematical optimization; Decomposition; State (computer science); Genetic algorithm; Metaheuristic; Point (geometry); Algorithm; Mathematics; Programming language; Artificial intelligence","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":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.003973996,0.002754463,0.002863454,0.0006378167,0.002697566,0.002161287,0.001941529,0.0013308,0.00007320413],"category_scores_gemma":[0.0007437989,0.002414381,0.0008183327,0.0004502586,0.0006649198,0.001410222,0.0007807685,0.002319197,0.0001076545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001417395,"about_ca_system_score_gemma":0.0004421333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005019001,"about_ca_topic_score_gemma":0.0001981274,"domain_scores_codex":[0.9862062,0.0005971331,0.003750551,0.004231905,0.001530597,0.003683579],"domain_scores_gemma":[0.9922722,0.001361977,0.001104255,0.003436448,0.0006163185,0.001208793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004760424,0.0006773787,0.000191023,0.03090755,0.0007023013,0.00003780325,0.002922713,0.9460778,0.001072651,0.0001070867,0.001293988,0.01553364],"study_design_scores_gemma":[0.002968773,0.0002476527,0.006897858,0.0009843399,0.0005402438,0.0004012094,0.002930292,0.004114969,0.8212956,0.002863629,0.1520025,0.004753019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6867883,0.002859003,0.2889135,0.001529207,0.002895346,0.009298602,0.001499874,0.003998965,0.002217178],"genre_scores_gemma":[0.9409777,0.000561262,0.04983308,0.0003731515,0.0004824926,0.002311401,0.0009456315,0.0004702055,0.004045094],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9419628,"threshold_uncertainty_score":0.9999825,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01867304781515853,"score_gpt":0.247967889241196,"score_spread":0.2292948414260375,"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."}}