{"id":"W3015682257","doi":"10.1002/nav.21901","title":"Efficient algorithms for flexible job shop scheduling with parallel machines","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Schedule; Upper and lower bounds; Mathematical optimization; Algorithm; Flow shop scheduling; 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.001764816,0.0009940639,0.001029269,0.0008860932,0.0008468776,0.001032614,0.001698385,0.0009609569,0.002826554],"category_scores_gemma":[0.004085638,0.0007135879,0.0008376074,0.001552448,0.0008741228,0.001245767,0.001597247,0.001103813,0.0004719198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001044147,"about_ca_system_score_gemma":0.001470386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003008737,"about_ca_topic_score_gemma":0.002540216,"domain_scores_codex":[0.9988455,0.0004335324,0.00006280407,0.0001859368,0.0002902441,0.000181962],"domain_scores_gemma":[0.9985374,0.0009409657,0.0001319167,0.0001832314,0.0001468126,0.000059685],"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.0001334503,0.00006437324,0.0001803282,0.00008276099,0.00002691788,0.00004469775,0.00004890649,0.9149947,0.001184471,0.02365764,0.001338173,0.05824359],"study_design_scores_gemma":[0.00003767119,0.00002112584,0.00004452827,0.000003680607,0.00000306192,0.000009326844,0.000007097675,0.9829974,0.0002869139,0.0160358,0.0005492207,0.000004173081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01465405,0.000223388,0.9826604,0.0001214759,0.00004204403,0.00008991479,0.00005533988,0.0003953236,0.001758159],"genre_scores_gemma":[0.3105617,0.0002544838,0.6861794,0.00004957999,0.00007416148,0.0003780025,0.000211547,0.0001584884,0.002132526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003008737,"threshold_uncertainty_score":0.00945574,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1385095194211587,"score_gpt":0.3646678265404282,"score_spread":0.2261583071192695,"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."}}