{"id":"W4403099496","doi":"10.1287/ijoc.2024.0603","title":"Domain-Independent Dynamic Programming and Constraint Programming Approaches for Assembly Line Balancing Problems with Setups","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Computer science; Dynamic programming; Domain (mathematical analysis); Assembly line; Constraint logic programming; Mathematical optimization; Constraint satisfaction; Reactive programming; Constraint (computer-aided design); Concurrent constraint logic programming; Inductive programming; Line (geometry); Algorithm; Programming paradigm; Programming language; Stochastic programming; Mathematics; Artificial intelligence; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001024954,0.0003648176,0.0003505659,0.0003058049,0.0003256719,0.000968189,0.0001513351,0.0001322597,0.00000127514],"category_scores_gemma":[0.00002949987,0.000278054,0.00009524081,0.0003160627,0.00004878562,0.0004886339,0.00004748592,0.0007234732,0.000002891816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003004353,"about_ca_system_score_gemma":0.0001093449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001883359,"about_ca_topic_score_gemma":0.00001143621,"domain_scores_codex":[0.9980203,0.00001575014,0.0006646264,0.0002810173,0.0003712656,0.0006470449],"domain_scores_gemma":[0.9992186,0.0001889668,0.0001632348,0.0001343865,0.00010726,0.0001875202],"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.00001822913,0.00001962646,0.0004105952,0.0006850676,0.0001571735,0.00003966778,0.001327201,0.627223,0.0001168889,0.0006789833,0.00001059929,0.369313],"study_design_scores_gemma":[0.0007745617,0.0004444694,0.0002442911,0.001773571,0.00004613816,0.001501343,0.000955635,0.9898233,0.0001312645,0.0001378981,0.003749993,0.0004174827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2429187,0.0004472511,0.7545539,0.0001054097,0.0003951367,0.00074644,0.000003467712,0.0005907916,0.0002388936],"genre_scores_gemma":[0.8394037,0.00001858192,0.1601165,0.00002206546,0.0002900852,0.00002682367,0.00002070871,0.00008816834,0.00001330518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.596485,"threshold_uncertainty_score":0.9999672,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01324474646002799,"score_gpt":0.2332381410911727,"score_spread":0.2199933946311447,"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."}}