{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.001432363,0.001519482,0.001358325,0.001005802,0.001486041,0.000782122,0.0007789825,0.0004140783,0.004112979],"category_scores_gemma":[0.0002497571,0.001915782,0.0005151873,0.001895514,0.0001269786,0.0002144283,0.0002634963,0.002279325,0.0001042916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008275248,"about_ca_system_score_gemma":0.000934143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000740608,"about_ca_topic_score_gemma":0.0001492691,"domain_scores_codex":[0.9929793,0.0003782322,0.001602741,0.001784026,0.001433092,0.00182263],"domain_scores_gemma":[0.9966201,0.0004156812,0.0008407593,0.0008690059,0.0004979505,0.0007564729],"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.0001531406,0.0004242866,0.0001536741,0.002676312,0.0002993302,0.00002134564,0.01834561,0.9655486,0.004690739,0.002562845,0.0001468824,0.004977279],"study_design_scores_gemma":[0.003020634,0.0002443164,0.00002895516,0.001248544,0.0002185188,0.00002909642,0.008438928,0.9785252,0.0004070573,0.00002379589,0.005802789,0.00201217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08750807,0.002266646,0.7093795,0.001950223,0.004551953,0.02389532,0.000400147,0.004921,0.1651271],"genre_scores_gemma":[0.4267771,0.000004101373,0.5616799,0.0002825751,0.0002323916,0.00114927,0.004169229,0.0004826116,0.005222803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.339269,"threshold_uncertainty_score":0.9998139,"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."}}