{"id":"W1995082853","doi":"10.1016/j.ejor.2012.04.008","title":"A constraint programming approach for a batch processing problem with non-identical job sizes","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Constraint (computer-aided design); Computer science; Constraint programming; Domain (mathematical analysis); Batch processing; Process (computing); Decomposition method (queueing theory); Algorithm; Mathematics; Stochastic programming","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":[],"consensus_categories":[],"category_scores_codex":[0.004264887,0.0001101258,0.000148717,0.0001809976,0.0002199844,0.0003271955,0.0001927389,0.00002382059,0.00002615376],"category_scores_gemma":[0.0002429955,0.00008173963,0.00004914567,0.0002785398,0.0001200617,0.0004215378,0.00002496057,0.0004476018,0.000009867514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006284432,"about_ca_system_score_gemma":0.000175557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.784379e-7,"about_ca_topic_score_gemma":1.471111e-7,"domain_scores_codex":[0.9982521,0.0001683237,0.0004019359,0.0001017219,0.0006770755,0.0003988273],"domain_scores_gemma":[0.9985243,0.0001228233,0.00005044774,0.00007209762,0.0009972951,0.0002330074],"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.0005602872,0.0009400643,0.007539276,0.001060862,0.0004936601,0.0001137143,0.01012481,0.7932943,0.005741928,0.003119197,0.003570716,0.1734412],"study_design_scores_gemma":[0.003551356,0.0009662336,0.003649248,0.0005523654,0.00005267638,0.001026434,0.003197532,0.9796101,0.001502839,0.0000266788,0.005365831,0.0004986502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02517566,0.0004233381,0.9666224,0.0002162205,0.00007102371,0.0003766986,0.000002780104,0.00003431911,0.007077618],"genre_scores_gemma":[0.5019238,0.000007551208,0.4974826,0.00001005255,0.0004304,0.00001198167,0.00000488177,0.00003036012,0.00009838954],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4767482,"threshold_uncertainty_score":0.3333245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05582610975836273,"score_gpt":0.323007351941702,"score_spread":0.2671812421833393,"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."}}