{"id":"W194540509","doi":"","title":"A Modeling for the Total Tardiness SMSDST Problem Using Constraint Programming.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Chicoutimi; Université du Québec","funders":"","keywords":"Tardiness; Constraint programming; Computer science; Mathematical optimization; Constraint satisfaction; Constraint (computer-aided design); Concurrent constraint logic programming; Constraint logic programming; Programming language; Job shop scheduling; Stochastic programming; Mathematics; Artificial intelligence; Embedded system; Routing (electronic design automation)","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.0004242765,0.0001812572,0.0001279705,0.0001351074,0.000312268,0.0007114011,0.0008435586,0.00008615825,0.0002318348],"category_scores_gemma":[0.0002036213,0.0001454681,0.0001102174,0.0002071206,0.0001763919,0.0003859648,0.0001114033,0.0003253579,0.00003443876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004852053,"about_ca_system_score_gemma":0.0002209285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009795476,"about_ca_topic_score_gemma":0.0001703657,"domain_scores_codex":[0.9984654,0.00002601664,0.0004327566,0.0004331424,0.0003767093,0.0002659507],"domain_scores_gemma":[0.9985967,0.0001686896,0.0001224154,0.0003219307,0.0007071781,0.00008307422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001842289,0.00004060465,0.00001109971,0.000002516931,0.00001734449,0.000001204776,0.0002150145,0.09124373,0.003913176,0.6184903,0.000003992481,0.2860426],"study_design_scores_gemma":[0.00004086669,0.00004110631,0.00001229963,0.00002585848,0.000006847022,0.00003654994,0.0002674717,0.9645073,0.003587562,0.0311032,0.0001933745,0.0001775758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009422014,0.00000376845,0.9818527,0.00456352,0.00223901,0.0005651997,0.00001378107,0.0001299667,0.001210103],"genre_scores_gemma":[0.8836192,0.00000550263,0.1158702,0.000144141,0.0002112572,0.00008546425,0.000007031337,0.000009508149,0.00004769015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8741972,"threshold_uncertainty_score":0.6860058,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1200230154725008,"score_gpt":0.3461662791720779,"score_spread":0.2261432636995771,"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."}}