{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009089148,0.0001695503,0.0001599223,0.0001121242,0.0003243693,0.0006648729,0.0007404842,0.0000592286,0.0000263697],"category_scores_gemma":[0.00002603646,0.0001103817,0.00005263956,0.0002643105,0.00002797467,0.0003660272,0.00008633157,0.0005291282,0.00003622449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005640749,"about_ca_system_score_gemma":0.00004266479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003651773,"about_ca_topic_score_gemma":4.647471e-7,"domain_scores_codex":[0.9988523,0.0000206597,0.0004196126,0.0001241207,0.0002160681,0.0003672709],"domain_scores_gemma":[0.999338,0.00002715282,0.00009561041,0.0001973811,0.0001062543,0.0002355964],"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.0000116482,0.0000413333,0.0000517261,0.000006647801,0.00002716645,0.000004342796,0.003954827,0.7766873,0.000002638256,0.0007648505,0.00007162135,0.2183759],"study_design_scores_gemma":[0.0003832795,0.0001974568,0.0001280837,0.00007942989,0.000007832269,0.0003681629,0.00223229,0.9931008,0.0001809581,0.00002912668,0.003060018,0.0002325281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03038753,0.00002612882,0.9154805,0.00004974021,0.0004989668,0.0004220214,0.00000110386,0.0002591709,0.05287484],"genre_scores_gemma":[0.4224911,0.000002215189,0.577063,0.0001952236,0.0002082216,0.000004098201,0.000002273778,0.00002165626,0.00001216132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3921036,"threshold_uncertainty_score":0.6411385,"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."}}