{"id":"W4293203540","doi":"10.1007/978-3-031-08011-1_17","title":"Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Integer programming; Cutting stock problem; Mathematical optimization; Scheduling (production processes); Constraint programming; Linear programming; Constraint (computer-aided design); Job shop scheduling; Algorithm; Optimization problem; Mathematics; Stochastic programming; Operating system","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"],"consensus_categories":[],"category_scores_codex":[0.0006544575,0.0005361567,0.0004949004,0.0006076103,0.0004301481,0.0004994805,0.0007879992,0.000202638,0.0001743816],"category_scores_gemma":[0.00004451553,0.0005947609,0.0001032312,0.0006311287,0.0002720543,0.0002177363,0.0004939256,0.001007721,0.000008428876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005768121,"about_ca_system_score_gemma":0.0002051301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002402967,"about_ca_topic_score_gemma":0.00001964829,"domain_scores_codex":[0.9970424,0.00001712624,0.000585752,0.000879381,0.0006885554,0.0007868489],"domain_scores_gemma":[0.9988749,0.0001642761,0.0001695592,0.0004495773,0.0001303347,0.0002113398],"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.00000166118,0.000008287247,0.00002746542,0.00009213043,0.00001476152,0.00001219639,0.0009950054,0.8108532,0.0007587871,0.0007443007,0.00001551322,0.1864766],"study_design_scores_gemma":[0.0001960954,0.00007906048,0.000001901607,0.0005972047,0.00001411219,0.00006083064,0.000002240391,0.9829354,0.0003146219,0.001515636,0.01352144,0.0007614203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001692541,0.0002490057,0.9944056,0.0001486804,0.0007770621,0.0008766702,0.00002099431,0.0004483401,0.00290443],"genre_scores_gemma":[0.07646745,0.00001237689,0.9225786,0.0005072482,0.0002112041,0.00002336721,0.00003967551,0.0001220972,0.00003802044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1857152,"threshold_uncertainty_score":0.9996504,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03535468562046633,"score_gpt":0.2604574626300776,"score_spread":0.2251027770096112,"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."}}