{"id":"W3177084066","doi":"","title":"Efficient Algorithms for Flexible Job Shop Scheduling with Parallel Machines","year":2020,"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 Toronto","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Algorithm; Flow shop scheduling; Upper and lower bounds; Approximation algorithm; Mathematics","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.00170336,0.001675033,0.001660615,0.0009238155,0.000907263,0.00120598,0.002195244,0.001251237,0.002438601],"category_scores_gemma":[0.003542699,0.001158789,0.001529835,0.002187567,0.0008860585,0.001618268,0.001625413,0.002467192,0.001001436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001325279,"about_ca_system_score_gemma":0.001820492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00229206,"about_ca_topic_score_gemma":0.001889546,"domain_scores_codex":[0.9988853,0.0003917255,0.00007451313,0.0002422558,0.0002835622,0.0001225997],"domain_scores_gemma":[0.9985963,0.0008277267,0.0001325677,0.000237244,0.0001511145,0.00005504168],"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.00008252497,0.00008522536,0.0002092731,0.0003853889,0.00007688038,0.0000491317,0.00007335886,0.8281466,0.001614315,0.04944963,0.003379881,0.1164478],"study_design_scores_gemma":[0.00004963506,0.0000350673,0.0000848007,0.00002015504,0.00001067845,0.00003519891,0.00001277133,0.948208,0.0005202575,0.04776755,0.003244383,0.0000114898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002869661,0.0009614466,0.994311,0.0001015627,0.00007061863,0.00005798287,0.00004129768,0.0003321955,0.001254285],"genre_scores_gemma":[0.1011733,0.001802661,0.8942663,0.00007922729,0.0001830154,0.000332335,0.0002990423,0.0002164513,0.001647647],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002438601,"threshold_uncertainty_score":0.0096156,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02597424252735754,"score_gpt":0.2479555810259531,"score_spread":0.2219813384985955,"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."}}