{"id":"W3146252962","doi":"","title":"NEW NONSTANDARD JOB SHOP SCHEDULING ALGORITHM","year":2008,"lang":"en","type":"article","venue":"机械工程学报(英文版)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Flow shop scheduling; Mathematical optimization; Computer science; Rate-monotonic scheduling; Scheduling (production processes); Dynamic priority scheduling; Job shop scheduling; Fair-share scheduling; Least slack time scheduling; Mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000130783,0.0002652878,0.0002723574,0.0001566983,0.0001972775,0.0000608993,0.0002336534,0.0001673452,0.0005441808],"category_scores_gemma":[0.00005140769,0.0002815909,0.0001144188,0.0004332034,0.00004688658,0.0002013572,0.0000379767,0.0003216467,0.0004609896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009135898,"about_ca_system_score_gemma":0.0001079202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003679959,"about_ca_topic_score_gemma":0.000009427808,"domain_scores_codex":[0.9985964,0.00001849351,0.0003234432,0.0002789235,0.0003445222,0.0004382454],"domain_scores_gemma":[0.9991941,0.00004947673,0.0000336123,0.0003455373,0.000085787,0.0002914594],"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.00001935596,0.00004686247,0.001955461,0.00004260441,0.0001996449,0.000206792,0.003281667,0.7309952,0.0004397541,0.0005074458,0.01894897,0.2433562],"study_design_scores_gemma":[0.001086083,0.00003738611,0.0003988824,0.00006242621,0.00002770241,0.0001496854,0.0003369374,0.9833767,0.003086631,0.00005965254,0.01079801,0.0005799124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02226761,0.001389266,0.9591545,0.0001482281,0.001480534,0.0001440935,0.0000199105,0.001348068,0.01404777],"genre_scores_gemma":[0.05086882,0.0004768856,0.9446838,0.0001571988,0.0009310446,0.00001213333,0.00003076285,0.0001131807,0.002726134],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2523815,"threshold_uncertainty_score":0.9999636,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01392342669654512,"score_gpt":0.220718381212435,"score_spread":0.2067949545158899,"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."}}