{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003622023,0.0001881142,0.0002614756,0.0002035059,0.0000697748,0.00005370318,0.00007250867,0.00007028403,0.00000529486],"category_scores_gemma":[0.000105819,0.0001249579,0.00005631663,0.000127609,0.000009046705,0.0002248699,0.000018186,0.0001697466,2.689731e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003840934,"about_ca_system_score_gemma":0.00001824537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002258053,"about_ca_topic_score_gemma":0.000002244004,"domain_scores_codex":[0.999171,0.00001047983,0.0003576334,0.0001360449,0.0001466307,0.0001782632],"domain_scores_gemma":[0.99941,0.0001338316,0.0001014369,0.0001012465,0.0001187343,0.0001347994],"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.0001051752,0.00006996089,0.0003261575,0.0002380224,0.0003092293,0.00001429688,0.0001771816,0.8017952,0.004519968,0.009881914,0.0001505189,0.1824123],"study_design_scores_gemma":[0.001191127,0.0001365228,0.0001708726,0.0001024411,0.00005409174,0.0001501049,0.00001402951,0.9963125,0.0001997187,0.001140537,0.0003426506,0.0001853982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02681343,0.0008902836,0.9713305,0.0001370526,0.0005765628,0.0001289136,0.00002642001,0.00007869129,0.0000181975],"genre_scores_gemma":[0.1203619,0.001273026,0.8772162,0.00002351856,0.001030337,0.00001189639,0.000005201445,0.00005741533,0.00002053921],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1945173,"threshold_uncertainty_score":0.5095636,"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."}}