{"id":"W7133070840","doi":"","title":"A Scheduling-based Constraint Programming Approach to Solving a Complex Two-dimensional Two-stage Cutting Stock Problem","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Tardiness; Constraint programming; Scheduling (production processes); Constraint (computer-aided design); Job shop scheduling; Cutting stock problem; Constraint logic programming; Variation (astronomy)","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.001261206,0.00125658,0.0008314525,0.0009200927,0.0005985521,0.001552561,0.001814127,0.001303205,0.005322753],"category_scores_gemma":[0.002867268,0.0008820305,0.00135683,0.002387967,0.0009334201,0.001282205,0.0009951697,0.001921813,0.0004363743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139928,"about_ca_system_score_gemma":0.002877862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01094576,"about_ca_topic_score_gemma":0.0126404,"domain_scores_codex":[0.9992657,0.0002575045,0.00003694191,0.0001617314,0.0001948546,0.00008316134],"domain_scores_gemma":[0.9983816,0.001195084,0.0001229232,0.00007923694,0.0001493531,0.00007180148],"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.00002109455,0.00005789453,0.0001619663,0.00008944306,0.00002191476,0.00004711853,0.00003114226,0.9653337,0.0007740607,0.01706757,0.0008413676,0.01555276],"study_design_scores_gemma":[0.00001261246,0.00002236165,0.00004177838,0.000007441707,0.000005888543,0.00001277079,0.00001197401,0.9941923,0.0002726502,0.004459186,0.0009558034,0.000005290329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01008178,0.0002161959,0.9844736,0.0003061426,0.00005046001,0.0001292602,0.0001451808,0.0001233323,0.004474085],"genre_scores_gemma":[0.1334215,0.0006199405,0.8609902,0.0002123252,0.00007712655,0.0004405123,0.0003095099,0.0001068813,0.003822043],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01094576,"threshold_uncertainty_score":0.0217641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04033374907423801,"score_gpt":0.327769393597488,"score_spread":0.2874356445232499,"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."}}