{"id":"W2219185070","doi":"10.1609/icaps.v23i1.13575","title":"An Optimal Constraint Programming Approach to the Open-Shop Problem","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Heuristics; Computer science; Mathematical optimization; Metaheuristic; Scheduling (production processes); Job shop scheduling; Benchmark (surveying); Concurrent constraint logic programming; Constraint (computer-aided design); Constraint satisfaction; Constraint logic programming; Artificial intelligence; Mathematics; Stochastic programming; Schedule","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.0003824008,0.0001829823,0.000164902,0.00009887214,0.0001713692,0.0009346051,0.00106043,0.00007771041,0.00002679517],"category_scores_gemma":[0.00007700924,0.0001201219,0.00003246341,0.0002049167,0.00006614216,0.0003416557,0.0001510502,0.0002835308,0.000008715601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003054017,"about_ca_system_score_gemma":0.00002958546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001876526,"about_ca_topic_score_gemma":2.423923e-7,"domain_scores_codex":[0.9989226,0.000008349831,0.0002947911,0.0002538437,0.0002985008,0.0002218684],"domain_scores_gemma":[0.9992897,0.00003126174,0.0001050993,0.0001028682,0.000367135,0.0001039556],"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.00003966366,0.0001159036,0.001568182,0.00008102178,0.0001554021,4.184944e-7,0.004338484,0.9496284,0.008777102,0.02436524,0.0006278545,0.01030232],"study_design_scores_gemma":[0.0002136134,0.000045113,0.0004075221,0.0002730856,0.00001005672,0.0000194387,0.003996545,0.9918436,0.002801093,0.0001285544,0.00009693967,0.0001643791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9352307,0.00006319532,0.009826641,0.002031607,0.000424155,0.001206161,0.00001400118,0.001059215,0.05014431],"genre_scores_gemma":[0.7920063,0.000004176935,0.2076616,0.0001174813,0.00005080193,0.00008368595,0.000007281269,0.00001959428,0.00004917534],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1978349,"threshold_uncertainty_score":0.9012419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03285429607784356,"score_gpt":0.2767991159189652,"score_spread":0.2439448198411216,"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."}}