{"id":"W2606942538","doi":"10.23977/jemm.2016.11005","title":"Approximation Algorithm for Scheduling Parallel Machines with Machine Eligibility Restrictions and special jobs","year":2016,"lang":"en","type":"article","venue":"Journal of Engineering Mechanics and Machinery","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; National Natural Science Foundation of China","keywords":"Computer science; Job shop scheduling; Mathematical optimization; Scheduling (production processes); Algorithm; Path (computing); Vertex (graph theory); Greedy algorithm; Mathematics; Graph; Theoretical computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118386,0.00106433,0.00152053,0.0007793801,0.0007223327,0.0008392336,0.001876442,0.001195584,0.003156451],"category_scores_gemma":[0.002770931,0.0005663702,0.0008193463,0.001530077,0.0006029972,0.001411146,0.00115249,0.00140949,0.0006379082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001396172,"about_ca_system_score_gemma":0.002580908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006506461,"about_ca_topic_score_gemma":0.006319111,"domain_scores_codex":[0.9992732,0.0002295698,0.0000373824,0.0001163339,0.0001774841,0.0001659569],"domain_scores_gemma":[0.9991834,0.0004451656,0.000108621,0.0001017308,0.00009988764,0.00006122383],"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.0001857644,0.00009478627,0.0004464354,0.00009999506,0.00003420376,0.00005579003,0.00006600421,0.9381628,0.001044153,0.01720097,0.002253294,0.04035587],"study_design_scores_gemma":[0.00002544412,0.00002752968,0.00004340016,0.000004782856,0.000005473409,0.00001607976,0.000009590205,0.9921606,0.0001342345,0.007046571,0.0005231977,0.000002990858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01658465,0.0002727867,0.9792976,0.0001660413,0.00004364162,0.0000740777,0.00008310444,0.0004582299,0.003019853],"genre_scores_gemma":[0.3205569,0.0003922836,0.6741235,0.0001354502,0.0000655414,0.000392109,0.0006454341,0.0001570544,0.003531667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006506461,"threshold_uncertainty_score":0.01293719,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008530472229660364,"score_gpt":0.2192082519278201,"score_spread":0.2106777796981598,"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."}}