{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007195371,0.0005123104,0.0008314684,0.0007777205,0.0005741029,0.0006538237,0.001702728,0.0004876755,0.003732988],"category_scores_gemma":[0.0009233838,0.0003526211,0.0005522009,0.0009615129,0.0003317872,0.0009912102,0.0006890558,0.000540779,0.0009759473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000532718,"about_ca_system_score_gemma":0.001743841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002064998,"about_ca_topic_score_gemma":0.00219987,"domain_scores_codex":[0.9994505,0.0001101236,0.00004534764,0.0001195035,0.0002239964,0.00005044971],"domain_scores_gemma":[0.9997053,0.00007806961,0.00003155443,0.00003771277,0.0001249296,0.00002247043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003838676,0.000260017,0.001099416,0.0004413482,0.00007704098,0.0002146165,0.0001359287,0.4362866,0.01172305,0.04926511,0.01316235,0.4869505],"study_design_scores_gemma":[0.00006985755,0.00008119847,0.0001349012,0.000005922497,0.000009760516,0.00008496228,0.00000718004,0.9849974,0.001155196,0.006220778,0.007222514,0.00001027891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0123851,0.0004020004,0.9817194,0.0001234243,0.0001898653,0.0001187715,0.0001390069,0.0008238072,0.004098522],"genre_scores_gemma":[0.1406611,0.0004505571,0.8492432,0.0001386015,0.000103011,0.0003387743,0.0009209966,0.0001380668,0.008005826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003732988,"threshold_uncertainty_score":0.01248807,"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."}}