{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004014537,0.001999821,0.002472525,0.001719047,0.00131254,0.003816111,0.005753472,0.003752696,0.007105321],"category_scores_gemma":[0.01135274,0.002309185,0.002980292,0.005622193,0.001532219,0.003217807,0.002325306,0.004995971,0.000895902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002538609,"about_ca_system_score_gemma":0.004050175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01871072,"about_ca_topic_score_gemma":0.01305081,"domain_scores_codex":[0.9971091,0.0008862776,0.0001533457,0.0005291526,0.001069676,0.0002524359],"domain_scores_gemma":[0.9937789,0.004712408,0.0003248589,0.000260681,0.0007027079,0.0002204071],"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.00004887858,0.00009622153,0.0001376324,0.0002145804,0.00007894629,0.0002054857,0.00005851451,0.9278562,0.0009638096,0.04855774,0.002539407,0.01924252],"study_design_scores_gemma":[0.00001607748,0.00001630826,0.00003929459,0.00001653378,0.00001632576,0.00002969287,0.000009597612,0.9850139,0.0001672093,0.01337973,0.001282443,0.00001284801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001629954,0.0003251791,0.9945866,0.0003601121,0.000101492,0.0001021508,0.0001193096,0.00007670645,0.002698624],"genre_scores_gemma":[0.07786331,0.001154116,0.9128694,0.0004071307,0.0003794182,0.0007613017,0.0003370507,0.0002412137,0.005987102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01871072,"threshold_uncertainty_score":0.03720367,"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."}}