{"id":"W3013516278","doi":"10.5267/j.ijiec.2019.12.001","title":"A discrete Jaya algorithm for permutation flow-shop scheduling problem","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Flow shop scheduling; Job shop scheduling; Permutation (music); Mathematical optimization; Scheduling (production processes); Computer science; Discrete manufacturing; Algorithm; Mathematics; Economics; Computer network; Production (economics); Microeconomics; Physics","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.0001850361,0.0001745484,0.0002288616,0.0002534802,0.0000448533,0.0001531864,0.0003098288,0.000113841,0.00002106813],"category_scores_gemma":[0.0003318335,0.0001856203,0.0001675697,0.0002719579,0.00001392414,0.0003294809,0.0000226642,0.0003623168,0.00000664519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001181542,"about_ca_system_score_gemma":0.00009499596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001067906,"about_ca_topic_score_gemma":1.276956e-7,"domain_scores_codex":[0.998661,0.00001423806,0.0006543868,0.0001250947,0.0003727067,0.0001725899],"domain_scores_gemma":[0.9987882,0.0001954457,0.0001601562,0.0000511618,0.0006266693,0.0001783514],"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.00001507831,0.00001321986,0.00001239447,0.000009206911,0.0002204715,0.000008852575,0.0005659139,0.9509862,0.0001942317,0.0001250219,0.0002437047,0.0476057],"study_design_scores_gemma":[0.00169405,0.00008336786,0.00000834707,0.0001117672,0.00004280614,0.00004150242,0.0001786653,0.9959653,0.0005110108,0.00007395401,0.001107648,0.000181605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003508228,0.000103494,0.9916953,0.001755051,0.002456896,0.000186315,0.00007191401,0.0001822883,0.00004055697],"genre_scores_gemma":[0.1906047,0.00001975734,0.8062127,0.00008317837,0.002918767,0.00001454347,0.00008669429,0.00005419329,0.000005423226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1870965,"threshold_uncertainty_score":0.7569377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02772607716525504,"score_gpt":0.2597911209544966,"score_spread":0.2320650437892415,"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."}}