{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001616974,0.001258846,0.001205505,0.001173785,0.0008366139,0.002193134,0.002117937,0.001172894,0.005016978],"category_scores_gemma":[0.00425183,0.0007220244,0.001400655,0.002662523,0.001238767,0.001644662,0.001329732,0.002673464,0.0005992182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00155572,"about_ca_system_score_gemma":0.004163837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008762138,"about_ca_topic_score_gemma":0.007806894,"domain_scores_codex":[0.9976509,0.0008255531,0.0001132344,0.0003725718,0.0008235871,0.000214197],"domain_scores_gemma":[0.9983235,0.001084927,0.0001033011,0.00009524596,0.0003007858,0.00009228096],"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.00004078184,0.00006989008,0.0001318559,0.0002300114,0.0000486808,0.0001282611,0.00005475334,0.7579917,0.0009116628,0.1786128,0.004230288,0.0575493],"study_design_scores_gemma":[0.00002679759,0.00003975268,0.00007651292,0.00004571454,0.00002473447,0.0000724718,0.00002733014,0.849875,0.0006900735,0.1381395,0.01095817,0.00002383745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002250926,0.0008094049,0.9877971,0.0004231392,0.0001187068,0.00008761775,0.000194953,0.00008841003,0.008229698],"genre_scores_gemma":[0.1350879,0.003233806,0.8536031,0.0003531139,0.0003148329,0.000421049,0.0005699314,0.0001722312,0.006244024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008762138,"threshold_uncertainty_score":0.01742232,"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."}}