{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007794274,0.001352389,0.001894446,0.0009656542,0.0008452217,0.002362504,0.001833394,0.002192716,0.009544251],"category_scores_gemma":[0.002310013,0.001707537,0.001617408,0.002866157,0.0008846493,0.001859397,0.001623258,0.001733398,0.0008666868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001196705,"about_ca_system_score_gemma":0.001573812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01010336,"about_ca_topic_score_gemma":0.008741152,"domain_scores_codex":[0.9995389,0.0001027319,0.00002612595,0.00009251092,0.0001751936,0.00006466408],"domain_scores_gemma":[0.9989994,0.0007178373,0.0000780304,0.00006956973,0.00008254885,0.00005260492],"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.00005667531,0.00005869708,0.0001899561,0.0001458884,0.00002644731,0.0001244103,0.00005644864,0.9308959,0.001953757,0.01941643,0.003462076,0.04361336],"study_design_scores_gemma":[0.00001015199,0.00001325787,0.00004727539,0.000006987886,0.000004662697,0.00002456983,0.00001100691,0.9901797,0.0003604887,0.008037147,0.001297242,0.000007522303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01348155,0.0002742739,0.9766192,0.0001841727,0.0001205255,0.0001082547,0.0001700876,0.0003063375,0.008735579],"genre_scores_gemma":[0.1131345,0.0004910053,0.8782856,0.0001431606,0.00008544005,0.0002864601,0.0003246155,0.0004488218,0.006800295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01010336,"threshold_uncertainty_score":0.03192872,"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."}}