{"id":"W2157541676","doi":"10.1287/ijoc.1100.0446","title":"An Optimal Constraint Programming Approach to the Open-Shop Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Heuristics; Mathematical optimization; Computer science; Metaheuristic; Branch and bound; Scheduling (production processes); Benchmark (surveying); Constraint logic programming; 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.001533256,0.001333888,0.001241816,0.001126413,0.000786581,0.001777935,0.002379835,0.001177331,0.004750445],"category_scores_gemma":[0.004358509,0.0006938739,0.001322725,0.002454772,0.001245987,0.001716718,0.001139317,0.002773009,0.0006742927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001307136,"about_ca_system_score_gemma":0.00355016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006840567,"about_ca_topic_score_gemma":0.007280212,"domain_scores_codex":[0.9979544,0.0007155312,0.00008847136,0.0003301549,0.0007422969,0.0001690474],"domain_scores_gemma":[0.9984976,0.001019064,0.00009547458,0.0001018894,0.000213863,0.00007208978],"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.00003580402,0.00007831175,0.0001105443,0.0002446354,0.0000469821,0.0001280245,0.00004817585,0.751153,0.001051649,0.1745181,0.003556878,0.06902795],"study_design_scores_gemma":[0.00002892454,0.00004217987,0.00006345053,0.00004519555,0.00002521523,0.00007112346,0.00002078126,0.8893802,0.0008126227,0.09878137,0.01070533,0.00002366275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001193368,0.0005657748,0.9920122,0.000272735,0.00008692389,0.00006606535,0.0001136432,0.00008187788,0.005607309],"genre_scores_gemma":[0.08253561,0.002488284,0.909754,0.0002859998,0.0002387613,0.0003528069,0.0003446849,0.0001382518,0.00386163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006840567,"threshold_uncertainty_score":0.01589179,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03676578007654528,"score_gpt":0.2597581262389925,"score_spread":0.2229923461624472,"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."}}