{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1020,"total_is_capped":false,"direct_labels_cover":2,"predictions_cover":1020,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"4890092d1e6b","filters":{"topic":"Scheduling and Optimization Algorithms"}},"results":[{"id":"W3047863327","doi":"10.1016/j.ejor.2020.07.063","title":"Machine learning for combinatorial optimization: A methodological tour d'horizon","year":2021,"lang":"en","type":"article","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1336,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Heuristics; Artificial intelligence; Machine learning; Combinatorial optimization; Point (geometry); Task (project management); Optimization problem; Mathematical optimization; Online machine learning; Active learning (machine learning); Mathematics; Algorithm","authors":[{"name":"Yoshua Bengio","is_ca":true},{"name":"Andrea Lodi","is_ca":true},{"name":"Antoine Prouvost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02949669187414749,"gpt":0.2493383453831598,"spread":0.2198416535090123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007235215,0.001600344,0.001558946,0.002519539,0.001530534,0.00428634,0.00244517,0.002279344,0.007179573],"category_scores_gemma":[0.01232126,0.00110171,0.002108816,0.004012181,0.0072705,0.006910164,0.004271044,0.009683134,0.001920583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004279803,"about_ca_system_score_gemma":0.004204208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004256891,"about_ca_topic_score_gemma":0.003282418,"domain_scores_codex":[0.995823,0.002830532,0.0001581325,0.0003565405,0.0006646044,0.000167249],"domain_scores_gemma":[0.9916258,0.006614101,0.0002852682,0.0008495549,0.0003577113,0.0002675817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001384739,0.000029734,0.00009884046,0.0002287845,0.00002569874,0.00003207249,0.0001250895,0.008902189,0.00007194123,0.9668077,0.00822778,0.01543643],"study_design_scores_gemma":[0.000008446739,0.00001830315,0.00008199906,0.0001929213,0.000008513662,0.00003509494,0.00006321676,0.01582854,0.0000645115,0.9354369,0.04824987,0.00001165201],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.001229742,0.03412768,0.9056283,0.02152884,0.001316975,0.00008953487,0.0002177999,0.0001535878,0.03570758],"genre_scores_gemma":[0.1473075,0.07669052,0.7357145,0.00876156,0.008793947,0.0009490324,0.0004914239,0.0007221645,0.02056928],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.007235215,"threshold_uncertainty_score":0.03826392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154429979","doi":"10.1016/j.ejor.2003.08.027","title":"Executing production schedules in the face of uncertainties: A review and some future directions","year":2003,"lang":"en","type":"review","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":690,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Scheduling (production processes); Production (economics); Schedule; Operations research; Production schedule; Face (sociological concept); Work schedule; Work (physics); Management science; Operations management; Economics; Mathematics; Engineering; Microeconomics; Sociology","authors":[{"name":"Haldun Aytuğ","is_ca":false},{"name":"Mark Lawley","is_ca":false},{"name":"Kenneth N. McKay","is_ca":true},{"name":"S. Mohan","is_ca":false},{"name":"Reha Uzsoy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09072389035271536,"gpt":0.3721100444108805,"spread":0.2813861540581651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002689952,0.001569033,0.003120237,0.001422948,0.0003169354,0.001857364,0.003263416,0.001393842,0.001946406],"category_scores_gemma":[0.005003673,0.0008271651,0.0009760881,0.004372417,0.0004686022,0.002851693,0.0006943055,0.0008845903,0.001632564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006056383,"about_ca_system_score_gemma":0.002137439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002691658,"about_ca_topic_score_gemma":0.002554046,"domain_scores_codex":[0.998867,0.0002133728,0.0001490813,0.0002326582,0.0004668511,0.00007101437],"domain_scores_gemma":[0.9967361,0.001941691,0.0003989408,0.0001761263,0.0006855953,0.00006144402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001265431,0.0001149365,0.0005049134,0.007752009,0.0001433938,0.0001226445,0.00005877026,0.03872589,0.002574176,0.004736467,0.004385877,0.9407544],"study_design_scores_gemma":[0.0003201226,0.001684978,0.00320841,0.007171081,0.0009001149,0.00299598,0.0005971355,0.1540639,0.02003781,0.05134459,0.7573865,0.0002894418],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.004383896,0.8596275,0.1306061,0.0006440697,0.000562795,0.00008207488,0.0001190773,0.0004578643,0.00351662],"genre_scores_gemma":[0.01848115,0.8893847,0.08910875,0.0002241207,0.0007420481,0.00008397051,0.0002827272,0.000105494,0.001587004],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003263416,"threshold_uncertainty_score":0.01422602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030395122","doi":"10.1016/j.aei.2006.05.004","title":"Applications of agent-based systems in intelligent manufacturing: An updated review","year":2006,"lang":"en","type":"article","venue":"Advanced Engineering Informatics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":547,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; National Research Council Canada","funders":"","keywords":"Manufacturing execution system; Negotiation; Supply chain; Multi-agent system; Computer science; Manufacturing engineering; Process management; Computer-integrated manufacturing; Scheduling (production processes); Engineering; Systems engineering; Engineering management; Business; Operations management; Artificial intelligence","authors":[{"name":"Weiming Shen","is_ca":true},{"name":"Qi Hao","is_ca":true},{"name":"Hyun Joong Yoon","is_ca":true},{"name":"Douglas H. Norrie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006032637507384548,"gpt":0.2183467126605937,"spread":0.2123140751532092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002629478,0.0008779328,0.001856873,0.002623841,0.0003989407,0.00304927,0.001408452,0.001789284,0.003450305],"category_scores_gemma":[0.00513368,0.0004968823,0.0006023773,0.005089262,0.0008589776,0.004318465,0.0007294835,0.001675591,0.002029715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007250054,"about_ca_system_score_gemma":0.001307673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001150159,"about_ca_topic_score_gemma":0.002237194,"domain_scores_codex":[0.9990615,0.0002168579,0.0001585544,0.0001340548,0.0003876331,0.00004133759],"domain_scores_gemma":[0.9936906,0.003843462,0.0003604937,0.0002279214,0.001739878,0.0001375931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001207863,0.0001445616,0.000721642,0.008405506,0.0001862188,0.0002824867,0.0001263114,0.002581989,0.002066009,0.01114523,0.03470694,0.9395124],"study_design_scores_gemma":[0.00005031801,0.0001663056,0.001002613,0.001841332,0.0003189423,0.001831325,0.0001307984,0.003546065,0.001572843,0.01047893,0.9789918,0.00006874299],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000724648,0.9828309,0.00919289,0.002062836,0.002186275,0.0000129671,0.00002742048,0.00005323009,0.002908762],"genre_scores_gemma":[0.004237362,0.9786084,0.01024329,0.001193375,0.003629418,0.00001418334,0.00006526052,0.00001865092,0.001990049],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003450305,"threshold_uncertainty_score":0.01390618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975784696","doi":"10.1016/j.dam.2007.02.003","title":"A survey of scheduling with controllable processing times","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":419,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Scheduling (production processes); Computer science; Dynamic priority scheduling; Mathematical optimization; Rate-monotonic scheduling; Fair-share scheduling; Data processing; Distributed computing; Mathematics; Database; Schedule","authors":[{"name":"Dvir Shabtay","is_ca":true},{"name":"George Steiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01243576526964326,"gpt":0.2328712612258647,"spread":0.2204354959562214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727563,0.001305212,0.001652898,0.001380436,0.0006661253,0.002501089,0.001671922,0.001153484,0.002968011],"category_scores_gemma":[0.003993401,0.0008538345,0.000908797,0.005677806,0.0009765057,0.002796771,0.0009562639,0.001571009,0.00103791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001372519,"about_ca_system_score_gemma":0.001869189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001109001,"about_ca_topic_score_gemma":0.0009187059,"domain_scores_codex":[0.9985697,0.0004245222,0.0001200954,0.0003048238,0.0004695627,0.0001112333],"domain_scores_gemma":[0.9984843,0.0009428918,0.0001281886,0.0001857417,0.0001955623,0.00006326133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001976815,0.0001945218,0.0007903453,0.00312188,0.00009923693,0.0001065006,0.0001167659,0.09310229,0.002659641,0.4765293,0.01550751,0.4075743],"study_design_scores_gemma":[0.00008433285,0.0002713107,0.0007366401,0.0004796806,0.0000896655,0.0003710334,0.00009636121,0.2950497,0.002525712,0.5191907,0.1810335,0.00007130713],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.008858852,0.1635691,0.795162,0.001697051,0.001115967,0.00009567081,0.0002488779,0.0004219741,0.02883047],"genre_scores_gemma":[0.2167774,0.3727943,0.3887742,0.001314096,0.005651343,0.0004311666,0.0009222525,0.000394052,0.01294121],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.002968011,"threshold_uncertainty_score":0.009958327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2518264398","doi":"10.1016/j.cor.2016.04.006","title":"Mixed Integer Programming models for job shop scheduling: A computational analysis","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":227,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Computer science; Integer programming; Mathematical optimization; Job shop scheduling; Constraint programming; Scheduling (production processes); Thread (computing); Algorithm; Mathematics; Stochastic programming; Programming language","authors":[{"name":"Wen-Yang Ku","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09631262454021754,"gpt":0.3475213637295705,"spread":0.251208739189353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002699001,0.00143892,0.001166307,0.0008194752,0.0007597618,0.002551613,0.002052233,0.001648678,0.006234124],"category_scores_gemma":[0.009566697,0.001208184,0.001533442,0.00120062,0.0008403238,0.002758496,0.001063938,0.002775181,0.0006626674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283484,"about_ca_system_score_gemma":0.00169117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003598855,"about_ca_topic_score_gemma":0.005498435,"domain_scores_codex":[0.9986702,0.0008773428,0.0000351904,0.00009978608,0.0002220211,0.00009544948],"domain_scores_gemma":[0.9935527,0.00552105,0.0003605186,0.0001639557,0.0002723093,0.0001294804],"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.00006420682,0.000110869,0.0003209334,0.0001002097,0.00004194766,0.00004306549,0.00004426987,0.8904958,0.0003043098,0.09883339,0.001714193,0.007926886],"study_design_scores_gemma":[0.000005115587,0.000009726231,0.00002790054,0.000004031159,0.000005205009,0.000004740774,0.000007050286,0.9872152,0.00003224369,0.01244531,0.0002412309,0.000002273002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.033702,0.001627998,0.9509274,0.001387135,0.0001727552,0.0001146345,0.0003431339,0.0001601303,0.0115648],"genre_scores_gemma":[0.6160601,0.002078361,0.3626791,0.0005270845,0.0004124179,0.0006923104,0.0005231525,0.0002019058,0.01682553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006234124,"threshold_uncertainty_score":0.02085519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1903284337","doi":"10.1109/sffcs.1999.814574","title":"Approximation schemes for minimizing average weighted completion time with release dates","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":207,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Preemption; Approximation algorithm; Polynomial-time approximation scheme; Scheduling (production processes); Time complexity; Job shop scheduling; Constant (computer programming); Computer science; Running time; Processor scheduling; Execution time; Mathematical optimization; Mathematics; Binary logarithm; Combinatorics; Algorithm; Parallel computing; Schedule","authors":[{"name":"Foto Afrati","is_ca":false},{"name":"Evripidis Bampis","is_ca":false},{"name":"Chandra Chekuri","is_ca":false},{"name":"David R. Karger","is_ca":false},{"name":"Claire Kenyon","is_ca":false},{"name":"Sanjeev Khanna","is_ca":false},{"name":"Ioannis Milis","is_ca":false},{"name":"Maurice Queyranne","is_ca":true},{"name":"Martin Skutella","is_ca":false},{"name":"Clifford Stein","is_ca":false},{"name":"M.N. Sviridenko","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009612584698921019,"gpt":0.1993969946474032,"spread":0.1897844099484821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003885357,0.001185988,0.001295094,0.0007905339,0.0006779917,0.001357156,0.002778963,0.001203988,0.001808849],"category_scores_gemma":[0.0127078,0.0006473233,0.0009116751,0.00158313,0.001068508,0.002349115,0.001412888,0.001845109,0.0004722331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001555911,"about_ca_system_score_gemma":0.001292721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002862492,"about_ca_topic_score_gemma":0.002374626,"domain_scores_codex":[0.9977657,0.000766282,0.0001148586,0.0003158542,0.0007294791,0.0003077869],"domain_scores_gemma":[0.9956368,0.002494632,0.0005475489,0.0006964953,0.0004188865,0.0002057472],"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.0004666447,0.00007977908,0.0007674779,0.0001335641,0.0000710127,0.00006204633,0.000127299,0.9051121,0.003366676,0.03417384,0.001626448,0.05401315],"study_design_scores_gemma":[0.00003142218,0.00007236326,0.0001285798,0.000007590879,0.00001318396,0.00003144266,0.00001513334,0.9828902,0.0013868,0.01469635,0.000718896,0.000008010902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03032379,0.0004435715,0.9671956,0.0001773446,0.00005017638,0.00005798124,0.00006555727,0.0004340034,0.001251976],"genre_scores_gemma":[0.4756271,0.0006563204,0.5202271,0.00009777475,0.0001067915,0.0002064022,0.0002810208,0.0002247609,0.00257285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003885357,"threshold_uncertainty_score":0.02054799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2612374285","doi":"10.1016/j.cie.2018.10.030","title":"Applications of learning curves in production and operations management: A systematic literature review","year":2018,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":201,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Forgetting; Learning curve; Production (economics); Categorization; Computer science; Systematic review; Knowledge management; Work (physics); Management science; Data science; Artificial intelligence; Engineering; Economics; Psychology; Political science","authors":[{"name":"C. H. Glock","is_ca":false},{"name":"Eric H. Grosse","is_ca":false},{"name":"Mohamad Y. Jaber","is_ca":true},{"name":"Timothy L. Smunt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01135881319542197,"gpt":0.2172388100715448,"spread":0.2058799968761228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02014237,0.001332972,0.005699218,0.01145771,0.0004934742,0.004050091,0.002024657,0.001827615,0.004723195],"category_scores_gemma":[0.09937012,0.0008264359,0.005191951,0.01614406,0.001201551,0.003944598,0.001666387,0.001564346,0.0004385856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002545834,"about_ca_system_score_gemma":0.01119128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004449668,"about_ca_topic_score_gemma":0.01117541,"domain_scores_codex":[0.9889116,0.004405624,0.003507102,0.0009497942,0.002049784,0.0001759257],"domain_scores_gemma":[0.8464274,0.1373779,0.008455834,0.001281673,0.00593055,0.0005266582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","study_design_scores_codex":[0.0003819224,0.0001160485,0.003628434,0.555553,0.007069757,0.0001309227,0.0004579143,0.001525224,0.0001799003,0.001835294,0.002381126,0.4267405],"study_design_scores_gemma":[0.0004063742,0.0007543527,0.01216255,0.8632411,0.04874994,0.0007286083,0.001258515,0.001291814,0.0005330712,0.005201359,0.06550392,0.0001684944],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00128731,0.9965606,0.001023214,0.0003141424,0.00005657376,0.000166672,0.0001839968,0.000007662051,0.0003997167],"genre_scores_gemma":[0.01552655,0.9806479,0.00303995,0.000281423,0.00007519747,0.0002141891,0.0001330577,0.000008164161,0.00007359997],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.02014237,"threshold_uncertainty_score":0.1065243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4252209735","doi":"10.1007/978-0-387-74437-7_12","title":"Scheduling Algorithms","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":175,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Algorithm","authors":[{"name":"Fayez Gebali","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0192833074180686,"gpt":0.2119657228259414,"spread":0.1926824154078728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004400698,0.001463878,0.0008476946,0.0009821296,0.0007107842,0.001785133,0.001323163,0.000833724,0.04378392],"category_scores_gemma":[0.001307078,0.0005715562,0.0006556332,0.001808302,0.0006856635,0.001752634,0.0008909561,0.002144914,0.03057138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001169032,"about_ca_system_score_gemma":0.001186653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303619,"about_ca_topic_score_gemma":0.001626323,"domain_scores_codex":[0.9995437,0.00006152022,0.00002037068,0.00009930133,0.0002376794,0.00003728932],"domain_scores_gemma":[0.9996172,0.0001195362,0.00001338399,0.0001253284,0.0001032894,0.00002123498],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003792512,0.00008870146,0.00009697235,0.0002536027,0.00002798973,0.00003573413,0.00006118466,0.0256942,0.00213817,0.2345773,0.1932829,0.5437053],"study_design_scores_gemma":[0.00001958475,0.00003707031,0.0001802083,0.0001410886,0.00002166422,0.0001519691,0.00002998412,0.05774576,0.002984921,0.2456484,0.6930173,0.00002207668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00157106,0.008520854,0.6091411,0.001253132,0.002452663,0.0001648693,0.0006045807,0.00298172,0.3733101],"genre_scores_gemma":[0.03732518,0.01754825,0.4273128,0.001156969,0.002293429,0.0004565152,0.00286543,0.001766073,0.5092753],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04378392,"threshold_uncertainty_score":0.1464719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3188522200","doi":"10.24963/ijcai.2021/595","title":"Combinatorial Optimization and Reasoning with Graph Neural Networks","year":2021,"lang":"en","type":"article","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":172,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Polytechnique Montréal","funders":"","keywords":"Computer science; Combinatorial optimization; Key (lock); Artificial intelligence; Artificial neural network; Graph; Theoretical computer science; Machine learning; Algorithm","authors":[{"name":"Quentin Cappart","is_ca":true},{"name":"Didier Chételat","is_ca":true},{"name":"Elias B. Khalil","is_ca":true},{"name":"Andrea Lodi","is_ca":true},{"name":"Christopher Morris","is_ca":true},{"name":"Petar Veličković","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007084019536007027,"gpt":0.1887620670911135,"spread":0.1816780475551064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738439,0.00131659,0.00102472,0.001686745,0.0005974399,0.0031026,0.001948245,0.002027873,0.005764413],"category_scores_gemma":[0.00844875,0.0007063188,0.00165316,0.002558656,0.002469817,0.004832303,0.001624054,0.002903172,0.0007603104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002037051,"about_ca_system_score_gemma":0.001262379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006057533,"about_ca_topic_score_gemma":0.006679104,"domain_scores_codex":[0.998553,0.0006590536,0.00009275812,0.0002929583,0.0003146309,0.00008766347],"domain_scores_gemma":[0.9969417,0.002433401,0.0001837236,0.0001917006,0.0001834552,0.00006585612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003468617,0.00004448877,0.0005015872,0.0004635031,0.0001164087,0.0001135527,0.00008325637,0.2818499,0.0002754783,0.6538697,0.006689235,0.05595816],"study_design_scores_gemma":[0.000009185823,0.000006532493,0.0001133081,0.00005712445,0.00001302662,0.00003350205,0.00001604435,0.3351241,0.0001396045,0.6595019,0.00497529,0.00001041761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007014,0.01244735,0.9576166,0.004045676,0.0003229756,0.00007701411,0.0003922623,0.0003121788,0.01777208],"genre_scores_gemma":[0.4160762,0.03205211,0.5301864,0.002035706,0.002133638,0.0005359957,0.001844379,0.0002941725,0.01484143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006057533,"threshold_uncertainty_score":0.01928395,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067884717","doi":"10.1016/j.cor.2005.07.004","title":"Scheduling and routing of automated guided vehicles: A hybrid approach","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":161,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Integer programming; Job shop scheduling; Routing (electronic design automation); Constraint programming; Distributed computing; Algorithm; Computer network; Mathematics","authors":[{"name":"Ayoub Insa Corréa","is_ca":true},{"name":"André Langevin","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05043721699695757,"gpt":0.3291782384169027,"spread":0.2787410214199451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009700204,0.001190931,0.001814404,0.001748279,0.0009427525,0.002440713,0.002712152,0.001756913,0.002970343],"category_scores_gemma":[0.001563513,0.001101213,0.001784384,0.001984792,0.0009029739,0.001738763,0.001663482,0.000888173,0.0004092363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152902,"about_ca_system_score_gemma":0.001414449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007386585,"about_ca_topic_score_gemma":0.007391786,"domain_scores_codex":[0.9992055,0.0002562387,0.00003397719,0.0001221472,0.0002541763,0.0001280039],"domain_scores_gemma":[0.9990977,0.00050008,0.00008309678,0.00007639146,0.0001618111,0.0000808069],"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.0001026399,0.00006600923,0.0002990199,0.00008597404,0.0001334774,0.00005635106,0.00005845206,0.9544355,0.001612003,0.01091202,0.0005509947,0.03168751],"study_design_scores_gemma":[0.00001049018,0.00002166761,0.00004373184,0.000002521324,0.00001651225,0.000007553126,0.00001293567,0.9967377,0.0001349926,0.00273532,0.0002719483,0.000004604926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03604781,0.0006682083,0.9563518,0.0002745629,0.0001694352,0.00008000285,0.00006916845,0.0002956741,0.00604336],"genre_scores_gemma":[0.6584333,0.0007560126,0.3304318,0.0002208063,0.0003589218,0.0003265394,0.0002081224,0.0002253024,0.009039178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007386585,"threshold_uncertainty_score":0.01468718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1571472016","doi":"10.1007/978-3-642-13520-0_23","title":"Automated Configuration of Mixed Integer Programming Solvers","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":152,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parameterized complexity; Integer programming; Domain (mathematical analysis); Integer (computer science); Process (computing); Linear programming; Mathematical optimization; Algorithm; Programming language; Mathematics","authors":[{"name":"Frank Hutter","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01002446137210096,"gpt":0.2252929834749474,"spread":0.2152685221028465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002098224,0.001544298,0.001272363,0.00137246,0.001178518,0.003827026,0.003855001,0.001146347,0.02594373],"category_scores_gemma":[0.009614418,0.001878212,0.001017369,0.001391144,0.0008620946,0.003888841,0.003787082,0.002401781,0.007274363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009501006,"about_ca_system_score_gemma":0.001817879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001351316,"about_ca_topic_score_gemma":0.002010375,"domain_scores_codex":[0.9972022,0.001160709,0.0001991389,0.0004053045,0.0007137595,0.0003189452],"domain_scores_gemma":[0.9948026,0.002279004,0.0002053659,0.001874748,0.000681008,0.0001572223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001299395,0.0004739517,0.001784644,0.0005193201,0.000166475,0.0005153991,0.0004232696,0.2043079,0.02135289,0.07176457,0.04366113,0.6537311],"study_design_scores_gemma":[0.0001080859,0.00005997433,0.0002778408,0.00007010827,0.00003431286,0.0001076722,0.00009783928,0.9037703,0.01945574,0.05204313,0.02393857,0.00003635896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01803015,0.0004420224,0.9265728,0.0003474935,0.000276349,0.0002191555,0.0005712296,0.025844,0.02769682],"genre_scores_gemma":[0.2003524,0.0002427466,0.784394,0.0002243792,0.00008057361,0.0004695164,0.00235169,0.003664428,0.008220248],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02594373,"threshold_uncertainty_score":0.08679038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3205671243","doi":"10.1016/j.jmsy.2021.09.018","title":"Real-time integrated production-scheduling and maintenance-planning in a flexible job shop with machine deterioration and condition-based maintenance","year":2021,"lang":"en","type":"article","venue":"Journal of Manufacturing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":132,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Government of Canada","keywords":"Job shop; Scheduling (production processes); Job shop scheduling; Computer science; Industrial engineering; Production planning; Production (economics); Benchmark (surveying); Process (computing); Engineering; Operations research; Reliability engineering; Mathematical optimization; Schedule; Flow shop scheduling; Operations management","authors":[{"name":"Mageed Ghaleb","is_ca":true},{"name":"Sharareh Taghipour","is_ca":true},{"name":"Hossein Zolfagharinia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008529663143927913,"gpt":0.2191855303361605,"spread":0.2106558671922325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001974504,0.0007384666,0.002066284,0.0005417425,0.0008982581,0.001230539,0.001563841,0.001487164,0.00144676],"category_scores_gemma":[0.002464957,0.001007702,0.000964299,0.0006616798,0.001044925,0.0008735865,0.0008824794,0.001027808,0.0001281761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009479916,"about_ca_system_score_gemma":0.001723967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01444064,"about_ca_topic_score_gemma":0.00805238,"domain_scores_codex":[0.9993204,0.0001925608,0.00002944506,0.0001584403,0.0001038865,0.0001953037],"domain_scores_gemma":[0.9977964,0.001419156,0.0002529655,0.00008918711,0.0001671973,0.0002750142],"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.0002954212,0.000091494,0.0005117529,0.00003362501,0.00002734335,0.0001736728,0.00003958754,0.9924859,0.001330994,0.001007263,0.0001063308,0.003896586],"study_design_scores_gemma":[0.00001390319,0.00003439763,0.0001623965,6.93977e-7,0.000006198157,0.000008654481,0.000004933211,0.9994129,0.0001305335,0.0002080293,0.00001403157,0.000003363404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5873696,0.0003323556,0.4092015,0.000335027,0.00008292563,0.0001140656,0.0001530461,0.0003515771,0.002059976],"genre_scores_gemma":[0.984378,0.00003346336,0.01481786,0.00001367611,0.00001126334,0.00003036488,0.00003750711,0.00001442947,0.0006633733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01444064,"threshold_uncertainty_score":0.02871323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046678043","doi":"10.1016/j.ejor.2005.02.077","title":"Integrated production and material handling scheduling using mathematical programming and constraint programming","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":128,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Constraint programming; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Resource constraints; Industrial engineering; Stochastic programming; Distributed computing; Mathematics; Engineering; Schedule","authors":[{"name":"Ghada El Khayat","is_ca":true},{"name":"André Langevin","is_ca":true},{"name":"Diane Riopel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06525778728490876,"gpt":0.325279648839937,"spread":0.2600218615550283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068037,0.001159075,0.002147066,0.001273125,0.0007789154,0.00322102,0.002086917,0.001159669,0.003398794],"category_scores_gemma":[0.003433221,0.00172802,0.001801088,0.002998628,0.000718295,0.002735387,0.001559666,0.001952774,0.0006424396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001800297,"about_ca_system_score_gemma":0.003732649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007155326,"about_ca_topic_score_gemma":0.007887901,"domain_scores_codex":[0.9984755,0.0003703642,0.00007494599,0.0002194946,0.0006721712,0.0001875],"domain_scores_gemma":[0.99844,0.0008414384,0.000205071,0.0001809284,0.0002515436,0.00008113597],"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.00008791788,0.0001021275,0.0001682245,0.00005885249,0.00004184253,0.0000298177,0.00001977623,0.9537556,0.001604071,0.01252231,0.0004301947,0.03117922],"study_design_scores_gemma":[0.00001259169,0.00002262879,0.0000438512,0.000003248807,0.000009868868,0.000005695323,0.0000038465,0.9949902,0.0006569449,0.003759299,0.000487197,0.000004541426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009149974,0.0001353891,0.9866991,0.0001155017,0.00004041549,0.0000746536,0.00006723865,0.0003325962,0.003385076],"genre_scores_gemma":[0.2788664,0.0003340671,0.7162992,0.00007975681,0.00007383239,0.0003323603,0.0002857697,0.0002255123,0.003503026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007155326,"threshold_uncertainty_score":0.01422739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017773796","doi":"10.1023/b:apin.0000027769.48098.91","title":"Local Search Genetic Algorithms for the Job Shop Scheduling Problem","year":2004,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":128,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Brock University","keywords":"Computer science; Crossover; Job shop scheduling; Tabu search; Genetic algorithm; Mathematical optimization; Operator (biology); Algorithm; Scheduling (production processes); Deadlock; Genetic operator; Local search (optimization); Schedule; Population-based incremental learning; Distributed computing; Artificial intelligence; Mathematics; Machine learning","authors":[{"name":"Beatrice M. Ombuki","is_ca":true},{"name":"Mario Ventresca","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02769975547881486,"gpt":0.2645209188918796,"spread":0.2368211634130648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119767,0.0004490999,0.0009325729,0.0006377104,0.0004695692,0.0008885188,0.001018081,0.001300873,0.001965928],"category_scores_gemma":[0.003807347,0.000335809,0.0004213198,0.001216818,0.001032372,0.0009992426,0.0007485232,0.001444,0.000468379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009189327,"about_ca_system_score_gemma":0.001029852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003597771,"about_ca_topic_score_gemma":0.003150329,"domain_scores_codex":[0.9994931,0.0002824279,0.00001193475,0.00004299471,0.000129148,0.00004032378],"domain_scores_gemma":[0.9988268,0.0008693479,0.00008320127,0.00005537127,0.0001213451,0.00004396491],"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.0000809815,0.00005609526,0.0001741019,0.00006069614,0.00002851124,0.00002924088,0.00006581345,0.9256436,0.0006105502,0.02964502,0.001780474,0.04182498],"study_design_scores_gemma":[0.00003366686,0.00002852213,0.0000551864,0.000007774069,0.000008650265,0.000007954693,0.00001262219,0.9797687,0.0001460824,0.01935619,0.0005702619,0.000004349851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02832421,0.001385196,0.9638569,0.0005960666,0.00006758155,0.00003483754,0.00004571306,0.000370543,0.00531898],"genre_scores_gemma":[0.6470084,0.001398928,0.3412449,0.0002826989,0.000158348,0.0002841745,0.0001975878,0.0002311014,0.009193983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003597771,"threshold_uncertainty_score":0.00715363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W27038116","doi":"10.1093/jnci/djw115","title":"Polyhedral Approaches to Machine Scheduling","year":2008,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Polyhedron; Scheduling (production processes); Mathematical optimization; Polyhedral combinatorics; Mathematical proof; Travelling salesman problem; Computer science; Cutting-plane method; Mathematics; Algorithm; Combinatorics; Integer programming; Regular polygon; Convex optimization","authors":[{"name":"Maurice Queyranne","is_ca":true},{"name":"Andreas S. Schulz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07337646448938698,"gpt":0.2119761857776887,"spread":0.1385997212883018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264081,0.002266288,0.001607075,0.00196111,0.0009599092,0.002511245,0.002685347,0.001558779,0.01357931],"category_scores_gemma":[0.003243733,0.001225137,0.001813725,0.005748951,0.001899385,0.002928949,0.001709297,0.004671843,0.004934224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002370678,"about_ca_system_score_gemma":0.001781668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003032977,"about_ca_topic_score_gemma":0.004019342,"domain_scores_codex":[0.9982544,0.0006068785,0.0001434859,0.0002985354,0.0005517314,0.0001449598],"domain_scores_gemma":[0.9988627,0.0006697268,0.00009187571,0.0001481813,0.0001759866,0.00005147346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002288033,0.00005815486,0.00009552639,0.0007697551,0.00004992598,0.00005418174,0.00009353161,0.1433129,0.0007395546,0.7525749,0.01225145,0.08997729],"study_design_scores_gemma":[0.00002523184,0.00003701689,0.0001063276,0.0002290351,0.00002517596,0.0001131406,0.00006373409,0.1261029,0.0005029052,0.7328395,0.1399316,0.00002336143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000600212,0.01507471,0.9569002,0.0008055071,0.0005224195,0.00009749806,0.0002280002,0.0001325461,0.02563886],"genre_scores_gemma":[0.05951409,0.07013898,0.8460385,0.0009880395,0.002068148,0.0007434587,0.0009852229,0.0002654569,0.01925816],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01357931,"threshold_uncertainty_score":0.04542732,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064816527","doi":"10.1016/j.disopt.2008.04.001","title":"The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":118,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tardiness; Travelling salesman problem; Sequence (biology); Mathematical optimization; Single-machine scheduling; Scheduling (production processes); Computation; Branch and bound; Integer programming; Computer science; Job shop scheduling; Linear programming relaxation; Mathematics; Algorithm; Schedule","authors":[{"name":"Louis-Philippe Bigras","is_ca":true},{"name":"Michel Gamache","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01172588068999795,"gpt":0.1993286561662797,"spread":0.1876027754762818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002673312,0.00208024,0.002535719,0.00123542,0.0009055759,0.002814088,0.003330152,0.003839406,0.006948476],"category_scores_gemma":[0.01240459,0.001880243,0.001736518,0.004174615,0.001999837,0.006109382,0.001489037,0.00385566,0.0008245819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002094117,"about_ca_system_score_gemma":0.002079139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003090469,"about_ca_topic_score_gemma":0.002728084,"domain_scores_codex":[0.9979556,0.0009536584,0.00007583642,0.0004510066,0.0003973579,0.0001665943],"domain_scores_gemma":[0.9939566,0.004388363,0.0007395567,0.0002449472,0.000341601,0.0003289433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002654161,0.0001762959,0.0004195914,0.0004395203,0.0001085767,0.0002158713,0.00008084088,0.784559,0.0009366754,0.1837938,0.006006368,0.02299796],"study_design_scores_gemma":[0.00003603581,0.00005177826,0.000247238,0.00002054255,0.00002657968,0.00006280094,0.00003922618,0.8890653,0.0002846745,0.108014,0.002127706,0.00002402756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04344192,0.005513518,0.933295,0.002469488,0.0007294106,0.0001213944,0.0005899072,0.0001577281,0.01368177],"genre_scores_gemma":[0.7128755,0.01140121,0.2319203,0.0007173455,0.002112253,0.0005722821,0.00160634,0.0003849936,0.03840976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006948476,"threshold_uncertainty_score":0.02324498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2236520910","doi":"10.1016/j.tcs.2016.01.002","title":"Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Backtracking; Algorithm; Task (project management); Assignment problem; Computer science; Mathematics; Process (computing); Mathematical optimization","authors":[{"name":"Haibin Zhu","is_ca":true},{"name":"Dongning Liu","is_ca":false},{"name":"Siqin Zhang","is_ca":false},{"name":"Yu Zhu","is_ca":true},{"name":"Luyao Teng","is_ca":false},{"name":"Shaohua Teng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004772503037445953,"gpt":0.1974227877428128,"spread":0.1926502847053669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001489414,0.00134993,0.002208692,0.001773705,0.001741948,0.00148588,0.002806198,0.002129215,0.009872815],"category_scores_gemma":[0.004587865,0.0008909812,0.00110336,0.002581757,0.001571948,0.003413467,0.002041216,0.002961449,0.002199804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000956195,"about_ca_system_score_gemma":0.002537266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005335957,"about_ca_topic_score_gemma":0.008517401,"domain_scores_codex":[0.9986456,0.0004243233,0.00006977042,0.0003145785,0.0003110817,0.000234714],"domain_scores_gemma":[0.9980747,0.0009990002,0.0001629583,0.0003892288,0.0002695038,0.0001045696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005836113,0.0006550357,0.000830241,0.0003931663,0.0001415642,0.0001377384,0.0002657947,0.5490047,0.006565154,0.07543793,0.01136854,0.3546165],"study_design_scores_gemma":[0.00009334731,0.00008017963,0.0001340452,0.00001575314,0.00002654868,0.00005663064,0.00004363583,0.9378957,0.001737589,0.05716009,0.00273481,0.00002159323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01958455,0.0002957716,0.9725213,0.0003156834,0.0001275362,0.00009392527,0.00005315282,0.001112216,0.00589592],"genre_scores_gemma":[0.147031,0.0001934563,0.8449433,0.0002103006,0.00008381631,0.0001208042,0.0001835601,0.0003446858,0.006889129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009872815,"threshold_uncertainty_score":0.03302789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065819816","doi":"10.1016/s0377-2217(01)00083-2","title":"Two-machine flow shops with limited machine availability","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Flow shop scheduling; Computer science; Time horizon; Mathematical optimization; Heuristic; Job shop scheduling; Flow (mathematics); Upper and lower bounds; Constant (computer programming); Time complexity; Algorithm; Mathematics; Routing (electronic design automation)","authors":[{"name":"Wiesław Kubiak","is_ca":true},{"name":"Jacek Błażewicz","is_ca":false},{"name":"Piotr Formanowicz","is_ca":false},{"name":"Joachim Breit","is_ca":false},{"name":"Günter Schmidt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05547564325294014,"gpt":0.2931843484889926,"spread":0.2377087052360525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004284571,0.001773209,0.00471219,0.001142372,0.001427774,0.002298608,0.003663225,0.003291415,0.004833683],"category_scores_gemma":[0.01193025,0.002288276,0.001707101,0.002020095,0.001740898,0.003585771,0.00257118,0.001947274,0.0004897444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001080882,"about_ca_system_score_gemma":0.001200469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001586547,"about_ca_topic_score_gemma":0.00150978,"domain_scores_codex":[0.9973749,0.001341045,0.000136542,0.0004199989,0.0002640705,0.0004634896],"domain_scores_gemma":[0.9805723,0.01517388,0.001351307,0.00100422,0.0006706685,0.001227731],"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.001392296,0.0002559359,0.0009608819,0.0004365248,0.0001375581,0.0008132081,0.0001092915,0.9599959,0.003018461,0.01991026,0.001592795,0.01137697],"study_design_scores_gemma":[0.0002008216,0.0001418739,0.0003331295,0.00001044249,0.00002218562,0.000104532,0.00002423088,0.9785379,0.0003834957,0.01987617,0.0003449288,0.00002025489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3071305,0.001418208,0.6836364,0.001016762,0.0003218002,0.0003159104,0.0009862926,0.0007798007,0.004394349],"genre_scores_gemma":[0.9126911,0.0003944974,0.08184917,0.000132596,0.0001860535,0.0002503545,0.0004872934,0.0001270333,0.003881956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004833683,"threshold_uncertainty_score":0.0226593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2255734301","doi":"10.1287/ijoc.2015.0666","title":"Decomposition Methods for the Parallel Machine Scheduling Problem with Setups","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Job shop scheduling; Solver; Mathematical optimization; Computer science; Travelling salesman problem; Scheduling (production processes); Metaheuristic; Decomposition; Benders' decomposition; Integer programming; Branch and bound; Algorithm; Mathematics; Routing (electronic design automation)","authors":[{"name":"Tony Tran","is_ca":true},{"name":"Arthur Araujo","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01518101738347567,"gpt":0.3035211131566281,"spread":0.2883400957731524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216271,0.001630216,0.00111452,0.00126676,0.0005608353,0.0009939228,0.001067807,0.001104315,0.004566712],"category_scores_gemma":[0.005091585,0.0007765234,0.001760869,0.001349632,0.0008229512,0.001375664,0.001315918,0.001993643,0.000646715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009608751,"about_ca_system_score_gemma":0.001496697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002946181,"about_ca_topic_score_gemma":0.002581218,"domain_scores_codex":[0.9989286,0.0005172117,0.00004102731,0.0001277425,0.0002478469,0.000137556],"domain_scores_gemma":[0.9981828,0.001389499,0.0001372607,0.00009769203,0.0001217156,0.00007092351],"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.0000697686,0.00008119724,0.0002608135,0.0001694214,0.00004920458,0.00005119137,0.00005626809,0.9272266,0.001421454,0.02821457,0.001315802,0.04108363],"study_design_scores_gemma":[0.00001959974,0.00002442246,0.00005318587,0.00001411728,0.00000836809,0.00001622922,0.000011321,0.9804217,0.0002750127,0.01832431,0.0008273597,0.000004378563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006732046,0.0003593559,0.9898021,0.0001466044,0.00004367008,0.00006546503,0.00005756375,0.0001447147,0.002648565],"genre_scores_gemma":[0.1995841,0.0009475087,0.794213,0.0001490149,0.000130566,0.0003754042,0.0003954229,0.0002905082,0.003914397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004566712,"threshold_uncertainty_score":0.01527715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984200231","doi":"10.1080/00207543.2013.827806","title":"Mathematical modelling and a meta-heuristic for flexible job shop scheduling","year":2013,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Windsor","funders":"","keywords":"Heuristics; Job shop scheduling; Benchmark (surveying); Mathematical optimization; Integer programming; Computer science; Simulated annealing; Heuristic; Scheduling (production processes); Algorithm; Mathematics","authors":[{"name":"Vahid Roshanaei","is_ca":true},{"name":"Ahmed Azab","is_ca":true},{"name":"H.A. ElMaraghy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1545567162866745,"gpt":0.3801708225125963,"spread":0.2256141062259218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007928711,0.0009767895,0.000639128,0.001500559,0.0004590967,0.001411984,0.001159396,0.001073058,0.002054762],"category_scores_gemma":[0.001321244,0.0005734114,0.001737871,0.001174827,0.0005494323,0.0009207776,0.000729697,0.000941204,0.0003585744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009610857,"about_ca_system_score_gemma":0.001491245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003279174,"about_ca_topic_score_gemma":0.00269398,"domain_scores_codex":[0.9995762,0.00017243,0.00002145536,0.00004755977,0.0001393009,0.00004310099],"domain_scores_gemma":[0.9995365,0.0002299178,0.0000871412,0.00005128251,0.00007367841,0.00002162898],"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.0000130823,0.00002245632,0.0001283477,0.00003518323,0.00002146229,0.00004073219,0.00001230153,0.9843698,0.0007540861,0.007857636,0.0001946334,0.006550321],"study_design_scores_gemma":[0.000003448462,0.00001738288,0.00003898059,0.000009235906,0.000006304579,0.00001024285,0.000006410999,0.9971557,0.0002729238,0.001830108,0.0006463734,0.000002851175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02971926,0.000925734,0.9597105,0.0003219749,0.00009434826,0.0001136119,0.0001247285,0.0002740729,0.008715712],"genre_scores_gemma":[0.5869516,0.001024765,0.4073225,0.00009891208,0.00007577498,0.0003759792,0.0002715806,0.00007590553,0.003802913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003279174,"threshold_uncertainty_score":0.006973147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013425394","doi":"10.1016/s0925-5273(03)00084-7","title":"Countering forgetting through training and deployment","year":2003,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Forgetting; Software deployment; Flexibility (engineering); Task (project management); Computer science; Context (archaeology); Similarity (geometry); Productivity; Artificial intelligence; Cognitive psychology; Psychology; Economics; Software engineering; Management","authors":[{"name":"Mohamad Y. Jaber","is_ca":true},{"name":"Hemant V. Kher","is_ca":false},{"name":"Darwin J. Davis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02265905760632428,"gpt":0.2391113325444366,"spread":0.2164522749381123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003179983,0.001299313,0.001576031,0.0007072237,0.0007291523,0.0009802604,0.002579068,0.001923941,0.001729427],"category_scores_gemma":[0.03523522,0.0007064049,0.000356616,0.0006545285,0.0009618193,0.003488868,0.001508496,0.002664729,0.0005281193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004580775,"about_ca_system_score_gemma":0.001451724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002433384,"about_ca_topic_score_gemma":0.002734794,"domain_scores_codex":[0.9985169,0.0004275163,0.0001247926,0.0003584365,0.0003150387,0.0002573763],"domain_scores_gemma":[0.9571466,0.02918485,0.002416837,0.005718839,0.00425314,0.001279692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002417321,0.00125581,0.01913706,0.0003761408,0.0001841691,0.0005601773,0.0005892814,0.34167,0.0178329,0.005786335,0.006113605,0.6040772],"study_design_scores_gemma":[0.00008234344,0.0003464034,0.002232052,0.00004283552,0.0001042527,0.0002606456,0.00008805689,0.9784068,0.008911605,0.008341016,0.001154299,0.00002965843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.413794,0.001621956,0.5725867,0.00183282,0.0008652946,0.00009253782,0.00009980878,0.004973255,0.004133603],"genre_scores_gemma":[0.9687318,0.0002172271,0.02942792,0.0002679531,0.0001533214,0.00003230542,0.00005442224,0.0001139526,0.001001035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003179983,"threshold_uncertainty_score":0.01681757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W653365980","doi":"10.1007/978-3-540-33876-5","title":"Multiagent based Supply Chain Management","year":2006,"lang":"en","type":"book","venue":"Studies in computational intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Supply chain management; Computer science; Supply chain; Artificial intelligence; Business; Marketing","authors":[{"name":"Brahim Chaib-draa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0390782186945678,"gpt":0.299767815151777,"spread":0.2606895964572092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003009935,0.0006678947,0.0005342626,0.0004732007,0.0003306154,0.001127446,0.0008800229,0.0005513171,0.007505216],"category_scores_gemma":[0.0004418862,0.000354695,0.0002621758,0.00130506,0.0003488707,0.00138879,0.0005884432,0.0008156057,0.001614146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005942697,"about_ca_system_score_gemma":0.0003541287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001286272,"about_ca_topic_score_gemma":0.001514954,"domain_scores_codex":[0.999822,0.00003566388,0.000008672674,0.00003023241,0.00009198237,0.00001144251],"domain_scores_gemma":[0.9998387,0.00006880583,0.00001609749,0.00002553456,0.00003753745,0.00001329065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006439164,0.0001570578,0.0002679407,0.0002259231,0.0000747864,0.0001353946,0.00009855044,0.3003411,0.004902625,0.1184014,0.03091016,0.5444207],"study_design_scores_gemma":[0.00002823733,0.00007951109,0.0004626455,0.00008949081,0.00003793701,0.0001534613,0.00006552847,0.705002,0.003938604,0.155566,0.1345549,0.00002180356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.007828441,0.008329538,0.8944042,0.001155162,0.000778134,0.00008868657,0.0001134387,0.0008304708,0.08647188],"genre_scores_gemma":[0.2850786,0.0159048,0.4859449,0.0004880068,0.000646071,0.0002860661,0.0005399837,0.000292673,0.210819],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.007505216,"threshold_uncertainty_score":0.02510744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1680007418","doi":"10.1007/978-0-387-88843-9","title":"Operations Research and Cyber-Infrastructure","year":2009,"lang":"en","type":"book","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Business","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02136525928509491,"gpt":0.2763886287476179,"spread":0.255023369462523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004926778,0.002460628,0.001736588,0.00224827,0.0006180489,0.002514553,0.0008671003,0.001158277,0.04949645],"category_scores_gemma":[0.00145478,0.0007142516,0.0005085114,0.004969575,0.001208715,0.003863209,0.0008290922,0.003632791,0.03496801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001885948,"about_ca_system_score_gemma":0.00178047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003480691,"about_ca_topic_score_gemma":0.007994054,"domain_scores_codex":[0.9995672,0.00005367878,0.00001896847,0.00006559885,0.0002690407,0.00002552565],"domain_scores_gemma":[0.9993637,0.000276961,0.00003478778,0.0001032191,0.0001718982,0.0000494007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001361445,0.00004278565,0.00007248762,0.0002097678,0.00001444497,0.00003086069,0.00005076156,0.006925002,0.0004133313,0.1289354,0.5533782,0.3099132],"study_design_scores_gemma":[0.000006109562,0.00001812511,0.0002619573,0.0001898529,0.00001165928,0.0001062616,0.000037852,0.007579767,0.0003436462,0.1731446,0.8182828,0.00001752292],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0008953332,0.06536024,0.1485878,0.006688919,0.008638375,0.0000742338,0.0008505646,0.001143848,0.7677608],"genre_scores_gemma":[0.009749888,0.04059527,0.03824523,0.001242415,0.003216685,0.0001381814,0.0008550389,0.0007279369,0.9052293],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.04949645,"threshold_uncertainty_score":0.1655821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976972714","doi":"10.1016/s0278-6125(00)80011-4","title":"Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms","year":2000,"lang":"en","type":"article","venue":"Journal of Manufacturing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Tardiness; Computer science; Staffing; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Flow shop scheduling; Genetic algorithm scheduling; Dynamic priority scheduling; Fair-share scheduling; Schedule; Mathematics","authors":[{"name":"Hoda ElMaraghy","is_ca":true},{"name":"Vishvas Patel","is_ca":false},{"name":"Imed Ben Abdallah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01795595434379066,"gpt":0.2304092839189099,"spread":0.2124533295751193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376253,0.0009187961,0.001738151,0.001244156,0.0007887742,0.001624907,0.001384442,0.001679824,0.001696834],"category_scores_gemma":[0.00379849,0.0009812088,0.0009047005,0.001536174,0.001073007,0.00113699,0.0009351635,0.001273706,0.0002079049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001831953,"about_ca_system_score_gemma":0.002286089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01010829,"about_ca_topic_score_gemma":0.00678413,"domain_scores_codex":[0.9992967,0.0002863774,0.00002759208,0.0001016495,0.0001365969,0.0001510446],"domain_scores_gemma":[0.9984465,0.0009946837,0.0002185896,0.00007966125,0.0001530549,0.0001074641],"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.00005151135,0.00002973463,0.00009652936,0.00001456692,0.00001449625,0.00001858142,0.00001571139,0.991161,0.0003435992,0.002171903,0.000166465,0.005915845],"study_design_scores_gemma":[0.00002234045,0.00001706515,0.00003326953,0.000002669329,0.000005500589,0.000003280642,0.000004981021,0.996963,0.0001519331,0.002697757,0.00009551767,0.00000268852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1419746,0.0006598537,0.8486151,0.0006065954,0.0001880082,0.0001679144,0.0001117846,0.0003630069,0.007313178],"genre_scores_gemma":[0.8236004,0.0003207592,0.1731643,0.0001148067,0.00007527727,0.00018289,0.0001555416,0.00007253235,0.002313464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01010829,"threshold_uncertainty_score":0.02009892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115919109","doi":"10.1109/tsmcc.2007.900670","title":"Toward Real-Time Distributed Intelligent Control: A Survey of Research Themes and Applications","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Real-time Control System; Distributed manufacturing; Control (management); Computer science; Key (lock); Scheduling (production processes); Intelligent control; Supply chain; Distributed computing; Process management; Systems engineering; Manufacturing engineering; Engineering; Operations management; Computer security; Artificial intelligence; Business","authors":[{"name":"Robert W. Brennan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05148171698706466,"gpt":0.308105615226717,"spread":0.2566238982396523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001286208,0.0008094708,0.001107156,0.002041518,0.0004750694,0.002635117,0.001196155,0.001782081,0.002316789],"category_scores_gemma":[0.001674051,0.0006515284,0.0005041608,0.00483761,0.001508809,0.0041519,0.0007832405,0.002031326,0.001248501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009435226,"about_ca_system_score_gemma":0.0009665332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001054712,"about_ca_topic_score_gemma":0.0006972433,"domain_scores_codex":[0.9991871,0.0001743409,0.00008958242,0.000179282,0.0003175894,0.000052241],"domain_scores_gemma":[0.998791,0.0006568302,0.00007551999,0.00008380174,0.000337588,0.00005533888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000863237,0.0002095572,0.0007589914,0.006356167,0.00006915478,0.0001456933,0.0004451622,0.01685172,0.002770232,0.1946726,0.01230582,0.7653286],"study_design_scores_gemma":[0.00005569814,0.000485557,0.001331103,0.002878926,0.00008991869,0.001138431,0.0007675985,0.04966954,0.002697357,0.1808641,0.7599086,0.0001132614],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.001867513,0.8991871,0.08328472,0.00206729,0.0004602647,0.00003381554,0.00001930827,0.0001217239,0.01295825],"genre_scores_gemma":[0.03021054,0.9226207,0.041448,0.0007086539,0.001573628,0.0000648962,0.00006009277,0.00004214492,0.003271334],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.002635117,"threshold_uncertainty_score":0.007750452,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035133691","doi":"10.1287/opre.48.1.177.12451","title":"Minimizing Cycle Time in a Blocking Flowshop","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blocking (statistics); Heuristic; Computer science; Set (abstract data type); Mathematical optimization; Throughput; Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Isa Nakhai Kamal Abadi","is_ca":false},{"name":"Nicholas G. Hall","is_ca":false},{"name":"Chelliah Sriskandarajah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02777353314887171,"gpt":0.3146552187995641,"spread":0.2868816856506924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007834854,0.0009266523,0.0007614734,0.0007149554,0.0007501646,0.0006973197,0.0008900516,0.0007753462,0.001765539],"category_scores_gemma":[0.001926542,0.0005192907,0.0003388757,0.0006663885,0.0007428366,0.0007791192,0.0006102848,0.00041016,0.0002052453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055711,"about_ca_system_score_gemma":0.001652336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007072453,"about_ca_topic_score_gemma":0.00460594,"domain_scores_codex":[0.999683,0.00006735849,0.000008935681,0.00005023007,0.00006486822,0.0001256784],"domain_scores_gemma":[0.9994123,0.0003224856,0.00008000658,0.00003396173,0.00005240958,0.0000987859],"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.00009564478,0.00004519112,0.0002872296,0.00005651989,0.00001299416,0.00005537433,0.00004827431,0.9787692,0.004752141,0.005741662,0.0003354057,0.009800323],"study_design_scores_gemma":[0.00002946005,0.0001011413,0.0001738349,0.00000805092,0.00001469759,0.00002994433,0.00002814352,0.9884192,0.002506697,0.008149774,0.0005298111,0.000009260077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5835469,0.0004996362,0.4076715,0.0002735197,0.00005064153,0.0001558112,0.0001254205,0.0004690574,0.007207409],"genre_scores_gemma":[0.8803535,0.000390401,0.1153982,0.00006142118,0.00002048585,0.0001469253,0.0001318518,0.0001353806,0.003361827],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007072453,"threshold_uncertainty_score":0.01406258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159737632","doi":"10.1111/j.1937-5956.2005.tb00019.x","title":"Setup Time Reduction for Electronics Assembly: Combining Simple (SMED) and IT‐Based Methods","year":2005,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Sheridan College","funders":"Alfred P. Sloan Foundation; University of California, San Diego; National Science Foundation","keywords":"Key (lock); Computer science; Printed circuit board; Electronics; Reduction (mathematics); Simple (philosophy); Process (computing); Manufacturing engineering; Reliability engineering; Embedded system; Electrical engineering; Mathematics; Engineering; Computer security; Operating system","authors":[{"name":"Sheri Coble Trovinger","is_ca":false},{"name":"Roger E. Bohn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01530818391747905,"gpt":0.2937214596672296,"spread":0.2784132757497505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090233,0.0008976306,0.0008094762,0.001091766,0.0004279118,0.0007718476,0.0008820468,0.0004859637,0.003832219],"category_scores_gemma":[0.002043144,0.0004837499,0.0009684694,0.001532823,0.00047653,0.001731468,0.0007750309,0.000647846,0.0006533786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000618495,"about_ca_system_score_gemma":0.0007520122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001866521,"about_ca_topic_score_gemma":0.002297904,"domain_scores_codex":[0.9992024,0.000273349,0.00004951592,0.0001002706,0.0002935239,0.00008097352],"domain_scores_gemma":[0.9981439,0.001168263,0.0001892844,0.0002359428,0.0001963424,0.00006628785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002745526,0.0003168981,0.001675657,0.0003767294,0.00008512984,0.00005926245,0.0001118994,0.2132858,0.02068812,0.008712164,0.002764302,0.7516496],"study_design_scores_gemma":[0.0001164997,0.0004414893,0.002075774,0.00002456917,0.00007071607,0.000148902,0.00006331299,0.9653381,0.01446197,0.01082422,0.006396578,0.00003789319],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05507433,0.00121581,0.9355394,0.0003759278,0.0000969286,0.00009496567,0.0000543321,0.0007589125,0.006789334],"genre_scores_gemma":[0.4341449,0.0007417848,0.5609388,0.0001717027,0.000131073,0.0001089685,0.000139196,0.0002797233,0.003343781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003832219,"threshold_uncertainty_score":0.01282007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3039856838","doi":"10.1016/j.cie.2020.106605","title":"An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached/detached setup, machine release date and lag-time","year":2020,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Sequence (biology); Selection (genetic algorithm); Genetic algorithm; Mathematical optimization; Algorithm; Set (abstract data type); Benchmark (surveying); Scheduling (production processes); Computer science; Mathematics; Schedule; Artificial intelligence","authors":[{"name":"Fantahun M. Defersha","is_ca":true},{"name":"Danial Rooyani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02890173795538531,"gpt":0.2399162774381865,"spread":0.2110145394828012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163055,0.0009475626,0.001344804,0.0008627845,0.0006342418,0.00107955,0.001954725,0.002729125,0.003078769],"category_scores_gemma":[0.002250447,0.0008305048,0.0009300471,0.0009811098,0.0006125298,0.0008201454,0.001130802,0.001232124,0.000449354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095162,"about_ca_system_score_gemma":0.00275318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009836839,"about_ca_topic_score_gemma":0.009310114,"domain_scores_codex":[0.9994954,0.0001494694,0.000021249,0.00009439253,0.0001557244,0.00008384419],"domain_scores_gemma":[0.9992853,0.0004443129,0.00005237325,0.00003532226,0.0001298713,0.00005280199],"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.0001289603,0.000137227,0.0003638032,0.00005311354,0.00003381913,0.00006616773,0.00004542002,0.9356624,0.002551838,0.004039504,0.0009300761,0.0559878],"study_design_scores_gemma":[0.00003724308,0.00003524968,0.00005607402,0.000002809764,0.00000588165,0.00000799091,0.000003287993,0.9989759,0.00017748,0.0005357726,0.0001585432,0.000003875315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02571039,0.0001471691,0.9698783,0.000194635,0.00008303231,0.0001753871,0.0000633194,0.0005513642,0.003196458],"genre_scores_gemma":[0.3045699,0.0001247745,0.6904743,0.0002174339,0.00004364624,0.0005399155,0.0002199508,0.000107203,0.003702847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009836839,"threshold_uncertainty_score":0.0195592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147965468","doi":"10.1287/opre.1040.0144","title":"Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach","year":2004,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Hoist (device); Integer programming; Scheduling (production processes); Schedule; Computer science; Mathematical optimization; Engineering; Algorithm; Mathematics; Operating system; Structural engineering","authors":[{"name":"Janny Leung","is_ca":false},{"name":"Guoqing Zhang","is_ca":true},{"name":"Xiaoguang Yang","is_ca":false},{"name":"Raymond W. T. Mak","is_ca":false},{"name":"Kokin Lam","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0718429271301883,"gpt":0.3443168042178998,"spread":0.2724738770877115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002111497,0.002020812,0.001710204,0.001058619,0.0007412742,0.002071429,0.002535576,0.001756365,0.004334814],"category_scores_gemma":[0.003920642,0.001336232,0.00131307,0.001969609,0.00100658,0.002191746,0.0009935886,0.001835217,0.0004280107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002322786,"about_ca_system_score_gemma":0.002294307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008203476,"about_ca_topic_score_gemma":0.009286719,"domain_scores_codex":[0.9986562,0.0006491729,0.00004541183,0.0002037919,0.0002084061,0.0002370821],"domain_scores_gemma":[0.9975227,0.001953403,0.0002111811,0.00005774605,0.0001616954,0.00009329962],"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.00006254713,0.00005145934,0.000132708,0.00008781614,0.00003055875,0.00003658718,0.00003746072,0.974037,0.0003350301,0.01440427,0.0006467701,0.01013777],"study_design_scores_gemma":[0.00001271822,0.00002720318,0.00003353632,0.0000066518,0.000007322878,0.000005636454,0.00001226467,0.9919708,0.0001328872,0.007309876,0.0004760853,0.000004909652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02367207,0.0007387453,0.9688503,0.0004058852,0.00006134259,0.0001188482,0.0002495029,0.0001694659,0.005733903],"genre_scores_gemma":[0.3776385,0.001533734,0.6109506,0.0003471078,0.0001580473,0.000635255,0.0006787427,0.0002678793,0.007790072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008203476,"threshold_uncertainty_score":0.01685303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4353070770","doi":"10.1287/ijoc.2023.1287","title":"Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Windsor","funders":"","keywords":"Integer programming; Computer science; Mathematical optimization; Constraint programming; Scheduling (production processes); Job shop scheduling; Flow shop scheduling; Schedule; Mathematics; Stochastic programming","authors":[{"name":"Bahman Naderi","is_ca":true},{"name":"Rubén Ruíz","is_ca":false},{"name":"Vahid Roshanaei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03150559591981477,"gpt":0.2621582092926764,"spread":0.2306526133728616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01022667,0.002544848,0.001833089,0.002909001,0.0009217361,0.007909136,0.0020714,0.002831833,0.007450467],"category_scores_gemma":[0.0189902,0.001180125,0.002234334,0.006066894,0.00306112,0.01272642,0.001937907,0.007851006,0.001614692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002863825,"about_ca_system_score_gemma":0.002047891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004597524,"about_ca_topic_score_gemma":0.002718815,"domain_scores_codex":[0.9961237,0.00177396,0.0001687497,0.0005004128,0.001175571,0.0002575742],"domain_scores_gemma":[0.97326,0.02277554,0.0005857826,0.001043422,0.001774346,0.0005608369],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004477652,0.000761541,0.003109447,0.003061308,0.0002712117,0.0003290857,0.0003551366,0.1259181,0.001091458,0.3743758,0.03100426,0.4592749],"study_design_scores_gemma":[0.00008527828,0.0004069401,0.001595719,0.002056774,0.0001156252,0.0003268611,0.0005771841,0.4523519,0.001558795,0.4381811,0.1026004,0.00014343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.01583734,0.5627115,0.3303743,0.03171642,0.003088949,0.0001409945,0.0004909247,0.0006743241,0.05496531],"genre_scores_gemma":[0.1924403,0.3899448,0.3841116,0.005759952,0.01174418,0.000371503,0.001308098,0.0007215285,0.01359794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01022667,"threshold_uncertainty_score":0.05408442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626429397","doi":"10.1016/j.ejor.2017.06.027","title":"Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Job shop scheduling; Flow shop scheduling; Computer science; Permutation (music); Heuristic; Mathematical optimization; Scheduling (production processes); Sequence (biology); Algorithm; Mathematics; Schedule","authors":[{"name":"Aymen Sioud","is_ca":true},{"name":"C Gagné","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05695077336828371,"gpt":0.3333236467879199,"spread":0.2763728734196362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004936774,0.0006982407,0.0009192208,0.000477357,0.0004218209,0.0005271327,0.001419683,0.000912013,0.003462475],"category_scores_gemma":[0.000842359,0.0003968293,0.0006761389,0.0004069364,0.0003106632,0.0005840988,0.0006987037,0.0008008696,0.0004147014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000454751,"about_ca_system_score_gemma":0.001124964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004834661,"about_ca_topic_score_gemma":0.005327003,"domain_scores_codex":[0.9997788,0.00006330306,0.000009106452,0.00004749693,0.00005448355,0.00004692674],"domain_scores_gemma":[0.9996821,0.0001309631,0.00003809251,0.00003085173,0.00007787558,0.00004018106],"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.0002902866,0.0001278772,0.0007402414,0.00008269996,0.00006122089,0.00009522657,0.00005767802,0.9037842,0.004428673,0.004467359,0.001726381,0.08413826],"study_design_scores_gemma":[0.00002511805,0.00005783516,0.0001043742,0.000002938549,0.000007517199,0.0000191111,0.000006793814,0.9982821,0.0003248102,0.0007107137,0.0004552391,0.000003506309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07168022,0.0002561386,0.9236031,0.0001420856,0.0001099925,0.0001071133,0.00008602507,0.0004780016,0.003537445],"genre_scores_gemma":[0.4435486,0.0001463914,0.548969,0.0001148998,0.00006259503,0.0002199022,0.0002598845,0.0001517667,0.006527005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004834661,"threshold_uncertainty_score":0.01158309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321381430","doi":"10.1016/j.engappai.2023.105977","title":"Solving energy-efficient fuzzy hybrid flow-shop scheduling problem at a variable machine speed using an extended NSGA-II","year":2023,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Fuzzy logic; Energy consumption; Scheduling (production processes); Sorting; Genetic algorithm; Population; Mathematical optimization; Algorithm; Artificial intelligence; Machine learning","authors":[{"name":"Yi-Jian Wang","is_ca":false},{"name":"Gai‐Ge Wang","is_ca":false},{"name":"Fang-Ming Tian","is_ca":false},{"name":"Dunwei Gong","is_ca":false},{"name":"Witold Pedrycz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02306533045524665,"gpt":0.2538835589898412,"spread":0.2308182285345945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005563463,0.0005549545,0.0007392118,0.0003512721,0.0004130099,0.0005549502,0.0005687005,0.0006113278,0.00133401],"category_scores_gemma":[0.0007339348,0.0003128967,0.000556378,0.0003569715,0.000270465,0.0003848082,0.0003409232,0.000400108,0.00007243689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004780962,"about_ca_system_score_gemma":0.001219114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01080339,"about_ca_topic_score_gemma":0.009512147,"domain_scores_codex":[0.9998376,0.00004771333,0.000009703476,0.00002432146,0.00004425486,0.00003648261],"domain_scores_gemma":[0.999733,0.0001475338,0.0000252586,0.00001334128,0.00006181814,0.00001895958],"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.00004509028,0.00002556962,0.0002091988,0.00002686923,0.00001467844,0.00002068854,0.00001102628,0.9911973,0.0007293489,0.0008623492,0.0001364238,0.006721388],"study_design_scores_gemma":[0.000008922173,0.00001854822,0.00008495668,0.000001683649,0.000004186766,0.000003281454,0.000004762601,0.9994253,0.0001447184,0.0002379034,0.00006445676,0.00000132807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3131858,0.0003431218,0.6749502,0.0002187082,0.000122627,0.0001566232,0.0001118322,0.0002785974,0.01063236],"genre_scores_gemma":[0.9376121,0.00007526469,0.06054541,0.00003989824,0.00001479426,0.000114448,0.00006496059,0.00001480408,0.001518356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01080339,"threshold_uncertainty_score":0.02148104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1601067015","doi":"","title":"Slack-Based Techniques for Robust Schedules","year":2014,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Tardiness; Computer science; Scheduling (production processes); Schedule; Real-time computing; Mathematical optimization; Job shop scheduling; Mathematics; Operating system","authors":[{"name":"Andrew Davenport","is_ca":false},{"name":"Christophe Gefflot","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01367933630756055,"gpt":0.220744325450681,"spread":0.2070649891431204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002876267,0.001411116,0.0005213296,0.00146974,0.0005059533,0.0007529526,0.001293382,0.0006933946,0.007123597],"category_scores_gemma":[0.01010517,0.0006790643,0.00117398,0.00151204,0.001082292,0.001579046,0.001433149,0.002222154,0.00174413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009863657,"about_ca_system_score_gemma":0.001084531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008204358,"about_ca_topic_score_gemma":0.0007980023,"domain_scores_codex":[0.9983725,0.0006034752,0.0001042387,0.0001790226,0.0006516805,0.00008902618],"domain_scores_gemma":[0.9957176,0.002888785,0.0006007293,0.0004595916,0.0002555767,0.00007775834],"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.0003495797,0.0001380575,0.0004232493,0.0007461498,0.0001227897,0.0003063954,0.0002887163,0.5565076,0.01751261,0.1635151,0.00475393,0.2553359],"study_design_scores_gemma":[0.0001223957,0.000352118,0.0002155466,0.0001435801,0.00006876523,0.0003199477,0.00005732726,0.8218545,0.01095638,0.1433964,0.02246807,0.00004502128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001584793,0.0003619223,0.9958392,0.00006779714,0.00004635226,0.00008307702,0.00004210925,0.0004156328,0.001559069],"genre_scores_gemma":[0.1255685,0.00124391,0.8692058,0.000199405,0.0001778416,0.0004273487,0.0002903845,0.0003786724,0.002508249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007123597,"threshold_uncertainty_score":0.02383077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027524005","doi":"10.1287/ijoc.1100.0388","title":"Combining Constraint Programming and Local Search for Job-Shop Scheduling","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Sandia National Laboratories; U.S. Department of Energy","keywords":"Tabu search; Constraint programming; Computer science; Job shop scheduling; Mathematical optimization; Guided Local Search; Flow shop scheduling; Hybrid algorithm (constraint satisfaction); Job shop; Local search (optimization); Scheduling (production processes); Iterated local search; Algorithm; Mathematics; Constraint logic programming; Schedule","authors":[{"name":"J. Christopher Beck","is_ca":true},{"name":"Tao Feng","is_ca":true},{"name":"Jean‐Paul Watson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01661260934949381,"gpt":0.2663230316757701,"spread":0.2497104223262763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002623989,0.0008633861,0.001280913,0.001069741,0.0006201279,0.001361233,0.001945228,0.001016129,0.002185787],"category_scores_gemma":[0.006616609,0.0005576619,0.0006985915,0.002409145,0.000904112,0.001583196,0.00157106,0.00144688,0.0006017668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107608,"about_ca_system_score_gemma":0.001780217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006929432,"about_ca_topic_score_gemma":0.008932111,"domain_scores_codex":[0.9982609,0.0007855543,0.00006278719,0.0001957843,0.0005895257,0.0001053622],"domain_scores_gemma":[0.9963581,0.002756856,0.0001771244,0.0002933725,0.000323128,0.00009135423],"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.00008038448,0.00009969343,0.0003617638,0.0001432988,0.00008021111,0.00005415557,0.00006508654,0.8541378,0.001934847,0.02182688,0.001347775,0.1198682],"study_design_scores_gemma":[0.00001059151,0.00002306964,0.00004215157,0.000005072861,0.000008572222,0.00001003518,0.000006311581,0.9937361,0.0006120834,0.004929075,0.0006101386,0.000006745968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007011356,0.0002299999,0.9892884,0.0001175332,0.00002002251,0.0000727533,0.0000261629,0.0006260078,0.002607651],"genre_scores_gemma":[0.2572678,0.0003897291,0.7391751,0.0002064708,0.00007592687,0.0003833042,0.0001229813,0.0002633515,0.002115218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006929432,"threshold_uncertainty_score":0.01387715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063635201","doi":"10.1016/j.cie.2009.01.010","title":"A genetic approach to two-phase optimization of dynamic supply chain scheduling","year":2009,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Procurement; Supply chain; Scheduling (production processes); Computer science; Tardiness; Build to order; Supply chain optimization; Mass customization; Job shop scheduling; Industrial engineering; Operations research; Personalization; Mathematical optimization; Supply chain management; Schedule; Engineering; Operations management; Production (economics); Business","authors":[{"name":"Alebachew D. Yimer","is_ca":true},{"name":"Kudret Demirli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01511577713601886,"gpt":0.2282072735914384,"spread":0.2130914964554195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128716,0.0007669228,0.001127093,0.001089235,0.0006165892,0.000984792,0.001543824,0.001801323,0.002563691],"category_scores_gemma":[0.002609891,0.0007218929,0.000883838,0.001707836,0.001130758,0.0008237966,0.0008029504,0.001221869,0.0002475591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001587165,"about_ca_system_score_gemma":0.002072533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01247998,"about_ca_topic_score_gemma":0.007278933,"domain_scores_codex":[0.9995977,0.0001812985,0.00001229077,0.00004145574,0.0001145019,0.00005279307],"domain_scores_gemma":[0.9993094,0.0004773306,0.00004479958,0.00002464817,0.0001098046,0.0000339907],"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.00001470312,0.00002352693,0.00005414948,0.00001291139,0.000012206,0.000015659,0.00001430003,0.9841452,0.0002109492,0.007966012,0.000173855,0.007356517],"study_design_scores_gemma":[0.00001491452,0.0000133279,0.0000258361,0.000002523054,0.000004805175,0.000003836251,0.000003513376,0.9951795,0.00005508574,0.004462712,0.0002309697,0.000002909695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01383472,0.0003182362,0.9807075,0.0003164485,0.00009204162,0.00007328548,0.00003188217,0.0001047341,0.004521091],"genre_scores_gemma":[0.4834065,0.0007338627,0.5082168,0.0002390775,0.0001600285,0.0003619575,0.0001095902,0.0001029547,0.006669246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01247998,"threshold_uncertainty_score":0.02481472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086111473","doi":"10.1016/j.cor.2004.01.001","title":"Parallel machine selection and job scheduling to minimize machine cost and job tardiness","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Computer science; Tabu search; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Selection (genetic algorithm); Due date; Heuristic; Algorithm; Schedule; Artificial intelligence; Mathematics","authors":[{"name":"Mingyuan Chen","is_ca":true},{"name":"Guohua Wan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03315502815199124,"gpt":0.3158891169154314,"spread":0.2827340887634402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001435692,0.0007112246,0.001522398,0.001074417,0.0009530059,0.0007279779,0.001057147,0.0008184115,0.002449125],"category_scores_gemma":[0.002307974,0.0005339131,0.000705459,0.00207872,0.0006241573,0.000707029,0.0004425763,0.0006651718,0.0003351778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009362493,"about_ca_system_score_gemma":0.001598682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002760291,"about_ca_topic_score_gemma":0.004109574,"domain_scores_codex":[0.9992754,0.0003097357,0.00002060957,0.0001144982,0.0001772686,0.0001024822],"domain_scores_gemma":[0.9991907,0.0004619816,0.0001100243,0.00005825881,0.0001235114,0.0000554444],"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.0005384095,0.0002356584,0.0006625654,0.0001232279,0.00008015941,0.0001080466,0.00004464633,0.9294631,0.006268101,0.007610315,0.002817198,0.05204861],"study_design_scores_gemma":[0.00005232685,0.00009091505,0.0003462635,0.000002718242,0.00001967603,0.00003045505,0.00001071474,0.9896456,0.001602029,0.007679636,0.0005141668,0.0000055602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1679201,0.0007735039,0.8214143,0.000667011,0.0002890212,0.0002433951,0.0001742716,0.0006529975,0.007865444],"genre_scores_gemma":[0.7284819,0.0004235503,0.260563,0.000176068,0.0002746342,0.0002341743,0.0002264867,0.0002437495,0.009376381],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002760291,"threshold_uncertainty_score":0.008193135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055063007","doi":"10.1016/j.ijpe.2007.02.031","title":"Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times","year":2007,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Manitoba","funders":"","keywords":"Job shop scheduling; Heuristics; Computer science; Mathematical optimization; Tabu search; Simulated annealing; Scheduling (production processes); Meta heuristic; Metaheuristic; Algorithm; Mathematics; Schedule","authors":[{"name":"S. Hamed Hendizadeh","is_ca":true},{"name":"Hamidreza Faramarzi","is_ca":true},{"name":"S. Afshin Mansouri","is_ca":false},{"name":"Jatinder N.D. Gupta","is_ca":false},{"name":"Tarek Y. ElMekkawy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03375852091847666,"gpt":0.2480555141112968,"spread":0.2142969931928201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00197469,0.001620589,0.00228219,0.002275072,0.00104902,0.001614383,0.001983603,0.002117121,0.002954603],"category_scores_gemma":[0.002486469,0.001738187,0.001566815,0.002192241,0.0008948006,0.001404519,0.000887714,0.001279084,0.0003030572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002559353,"about_ca_system_score_gemma":0.001923011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01077519,"about_ca_topic_score_gemma":0.01100437,"domain_scores_codex":[0.9994986,0.0001930254,0.00002618943,0.00007797385,0.00008691721,0.0001173116],"domain_scores_gemma":[0.9979076,0.00152623,0.0002366318,0.00007507886,0.000132578,0.0001219922],"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.00008404045,0.00004140481,0.0001844583,0.00003056612,0.00003605621,0.00003721736,0.00001948415,0.9895703,0.0004393256,0.001350946,0.0003145135,0.007891832],"study_design_scores_gemma":[0.00004059565,0.00007129645,0.00009802336,0.000008259067,0.00002520961,0.00001071319,0.00001241134,0.998026,0.0002763314,0.001207717,0.0002165678,0.000006947063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2314029,0.00184742,0.7556753,0.0004958649,0.0002516939,0.0004009418,0.0005710991,0.0009250464,0.008429764],"genre_scores_gemma":[0.7602943,0.0005586175,0.2349329,0.0001580567,0.000076985,0.0004470436,0.0003853807,0.0001386382,0.003008043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01077519,"threshold_uncertainty_score":0.02142495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2994826758","doi":"10.1016/j.jmsy.2019.11.010","title":"Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility","year":2019,"lang":"en","type":"article","venue":"Journal of Manufacturing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; Ontario Centres of Excellence","keywords":"Job shop scheduling; Tardiness; Simulated annealing; Mathematical optimization; Job shop; Scheduling (production processes); Integer programming; Computer science; Algorithm; Flow shop scheduling; Schedule; Mathematics","authors":[{"name":"Alejandro Vital-Soto","is_ca":true},{"name":"Ahmed Azab","is_ca":true},{"name":"Fazle Baki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01927759036749453,"gpt":0.2302902704082289,"spread":0.2110126800407343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481648,0.0006606999,0.0007517135,0.0005877244,0.0006342944,0.001079092,0.001064765,0.001767967,0.002160767],"category_scores_gemma":[0.002657308,0.0005897985,0.000993901,0.0007869948,0.0009018884,0.0009555889,0.0009437316,0.001059375,0.0002709559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009695635,"about_ca_system_score_gemma":0.001488218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00824243,"about_ca_topic_score_gemma":0.004194471,"domain_scores_codex":[0.9996513,0.0001435697,0.00001245712,0.00004168168,0.0001120077,0.0000389453],"domain_scores_gemma":[0.9991325,0.0006013237,0.00007731703,0.00003017758,0.0001244248,0.00003435225],"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.00000757515,0.000007223505,0.00005794269,0.000009881055,0.000005475636,0.00001508057,0.00001117836,0.9893189,0.0003350012,0.008585077,0.0001014613,0.001545206],"study_design_scores_gemma":[0.000001399784,0.000003504527,0.00001340194,9.644197e-7,0.000001011405,0.00000245159,0.000001553593,0.9987665,0.00002818875,0.00111665,0.00006313767,0.000001224619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02485377,0.0002795039,0.9659804,0.0003934199,0.00007919005,0.00003830337,0.00003831821,0.00007670109,0.008260524],"genre_scores_gemma":[0.7672114,0.0004896294,0.2240224,0.0001418295,0.0000867117,0.0002774285,0.00009359305,0.00009035321,0.007586628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00824243,"threshold_uncertainty_score":0.01638889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989829168","doi":"10.1007/s00170-008-1558-6","title":"A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem","year":2008,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Tardiness; Variable neighborhood search; Mathematical optimization; Flow shop scheduling; Job shop scheduling; Computer science; Permutation (music); Algorithm; Scheduling (production processes); Genetic algorithm; Mathematics; Metaheuristic; Schedule","authors":[{"name":"Alireza Rahimi-Vahed","is_ca":true},{"name":"Mostafa Dangchi","is_ca":false},{"name":"Hamed Rafiei","is_ca":false},{"name":"Ehsan Salimi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01587845214281209,"gpt":0.2619729909600718,"spread":0.2460945388172597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008269299,0.0008357717,0.001474972,0.0008377834,0.0006154461,0.0009301871,0.002034702,0.002155423,0.002982876],"category_scores_gemma":[0.001092405,0.0006266689,0.0008976195,0.0009770055,0.0004276047,0.0007560711,0.001100817,0.0008840405,0.0004605633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000599966,"about_ca_system_score_gemma":0.001168423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002978143,"about_ca_topic_score_gemma":0.00302146,"domain_scores_codex":[0.9996145,0.000133299,0.00001629524,0.00004968585,0.0001366432,0.00004945453],"domain_scores_gemma":[0.9996599,0.0001518808,0.00003000092,0.00003029651,0.00008499177,0.00004295663],"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.0001273824,0.0001334762,0.0003520719,0.00009086222,0.00009676514,0.0001128251,0.00004501134,0.9150172,0.005038439,0.006916766,0.001726802,0.07034239],"study_design_scores_gemma":[0.00002633316,0.00004420905,0.0000459339,0.000003330495,0.000006303309,0.00002549787,0.000003652427,0.9983877,0.0002471707,0.000755287,0.000449191,0.0000053077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03120843,0.0003066747,0.9621362,0.00018468,0.00009809327,0.0001374356,0.00006969919,0.0005574558,0.005301252],"genre_scores_gemma":[0.27707,0.0001752592,0.7156357,0.0002004654,0.0000483035,0.0004182364,0.0001813794,0.0001403286,0.00613038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002982876,"threshold_uncertainty_score":0.009978771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018507331","doi":"10.1111/j.1937-5956.2002.tb00494.x","title":"PRACTICE‐FOCUSED RESEARCH ISSUES FOR SCHEDULING SYSTEMS*","year":2002,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Scheduling (production processes); Computer science; Operations research; Industrial engineering; Operations management; Engineering","authors":[{"name":"Kenneth N. McKay","is_ca":true},{"name":"Michael Pinedo","is_ca":false},{"name":"Scott Webster","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07076953537627277,"gpt":0.3274995812672346,"spread":0.2567300458909618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04333514,0.00188175,0.001507703,0.001574491,0.003808469,0.01376917,0.005497384,0.008517816,0.0133055],"category_scores_gemma":[0.0947614,0.001034181,0.001319437,0.004036776,0.01122007,0.02073335,0.004342224,0.009183388,0.003391551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008429051,"about_ca_system_score_gemma":0.01242561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005273219,"about_ca_topic_score_gemma":0.00274691,"domain_scores_codex":[0.9726745,0.0182746,0.001469574,0.002184038,0.004288934,0.001108236],"domain_scores_gemma":[0.8888118,0.08361622,0.002647345,0.01017062,0.01291339,0.001840536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003005278,0.0001361572,0.0003636227,0.0004972148,0.00002283127,0.00005382546,0.0005629858,0.006179732,0.0001779861,0.9474263,0.005583548,0.03896565],"study_design_scores_gemma":[0.00002652158,0.00008013751,0.0001678829,0.0004066927,0.00001151361,0.00008180948,0.0009212835,0.018152,0.0003260958,0.9248719,0.05493543,0.00001875346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"commentary","genre_scores_codex":[0.01090504,0.0351306,0.6456619,0.1978176,0.002775186,0.0005167398,0.0001809867,0.0003099976,0.1067019],"genre_scores_gemma":[0.4654319,0.04327096,0.4445233,0.01513498,0.007173021,0.002289231,0.0004600684,0.0003417934,0.02137478],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.04333514,"threshold_uncertainty_score":0.2291809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999513701","doi":"10.1080/00207540110095222","title":"Hybrid genetic algorithm for the economic lot-scheduling problem","year":2002,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Job shop scheduling; Genetic algorithm; Heuristic; Algorithm; Operations research; Mathematics; Schedule","authors":[{"name":"Ilkyeong Moon","is_ca":false},{"name":"Edward A. Silver","is_ca":false},{"name":"Sung Woo Choi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05587131126522115,"gpt":0.3257764368061765,"spread":0.2699051255409553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000637389,0.0005795261,0.0006612035,0.0006599489,0.0003991878,0.0006646499,0.0009410693,0.001084347,0.001397109],"category_scores_gemma":[0.001180718,0.0002949591,0.0005210852,0.0008501634,0.0005756815,0.0005196455,0.0005575481,0.0006306373,0.0002329063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007266745,"about_ca_system_score_gemma":0.0009386234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004695289,"about_ca_topic_score_gemma":0.003682798,"domain_scores_codex":[0.9997464,0.00009459541,0.000009712016,0.0000344399,0.00008401791,0.00003090681],"domain_scores_gemma":[0.9996166,0.0002682211,0.00003107998,0.0000151077,0.00005076396,0.00001814142],"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.00003452958,0.00002797809,0.000204305,0.00002077944,0.00002512059,0.00003347025,0.00002090735,0.9679465,0.0006457177,0.009111457,0.0004446213,0.02148457],"study_design_scores_gemma":[0.00001991546,0.00001864593,0.00005136547,0.00000278594,0.000005655396,0.00001076221,0.000004500953,0.9962465,0.000141073,0.003095335,0.0004001255,0.000003230644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03223032,0.0004322829,0.9617091,0.0002084467,0.00005566518,0.00006845386,0.00004438006,0.0003337262,0.00491754],"genre_scores_gemma":[0.6091294,0.0004852599,0.3852381,0.0001919318,0.00004385336,0.000390214,0.0001770475,0.00006685863,0.004277387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004695289,"threshold_uncertainty_score":0.009335935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171618037","doi":"10.1007/s00170-009-2388-x","title":"A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups","year":2009,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Flow shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Job shop; Fair-share scheduling; Sequence (biology); Minification; Algorithm; Mathematics; Routing (electronic design automation); Schedule","authors":[{"name":"Fantahun M. Defersha","is_ca":true},{"name":"Mingyuan Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01108233046633449,"gpt":0.2520856453898344,"spread":0.2410033149234999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038743,0.0007411742,0.001261668,0.0008409034,0.0008698811,0.0008516642,0.001649304,0.001989204,0.00292246],"category_scores_gemma":[0.002063929,0.0007265689,0.0008890523,0.001268248,0.0008094399,0.0007508222,0.001018684,0.001101654,0.0003958355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001146137,"about_ca_system_score_gemma":0.002189334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01105335,"about_ca_topic_score_gemma":0.009106096,"domain_scores_codex":[0.9996456,0.00009286015,0.00001367917,0.00006908036,0.0001269661,0.00005182255],"domain_scores_gemma":[0.9993895,0.0003635568,0.00004985549,0.00003873407,0.0001162746,0.00004212771],"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.00006019589,0.00005257122,0.0001627766,0.0000256613,0.00002107092,0.00004255643,0.00002072902,0.9672605,0.000949925,0.00281067,0.0005480279,0.02804529],"study_design_scores_gemma":[0.00003297156,0.00001755448,0.00003603974,0.000001879959,0.000005482048,0.000008376034,0.000003111011,0.9983031,0.0001197991,0.001297526,0.0001713392,0.000002839331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03592643,0.0002220658,0.957481,0.0003722527,0.0001389105,0.0001490447,0.000068537,0.0005676396,0.005074103],"genre_scores_gemma":[0.3368204,0.0002094356,0.6572385,0.0001854815,0.00008298603,0.0003965735,0.0001426427,0.0001325514,0.004791273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01105335,"threshold_uncertainty_score":0.02197802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002455648","doi":"10.1016/s0305-0483(01)00048-2","title":"Heuristic algorithms for the two-machine flowshop with limited machine availability","year":2001,"lang":"en","type":"article","venue":"Omega","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Job shop scheduling; Computer science; Heuristic; Mathematical optimization; Constructive; Algorithm; Scheduling (production processes); Mathematics; Artificial intelligence; Schedule; Process (computing)","authors":[{"name":"Jacek Błażewicz","is_ca":false},{"name":"Joachim Breit","is_ca":false},{"name":"Piotr Formanowicz","is_ca":false},{"name":"Wiesław Kubiak","is_ca":true},{"name":"Günter Schmidt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01634579333903639,"gpt":0.2402695771085099,"spread":0.2239237837694735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581227,0.0009335975,0.001408836,0.001029784,0.0008193128,0.00121655,0.001721283,0.001391824,0.003331046],"category_scores_gemma":[0.004391675,0.0008437129,0.0006121527,0.001454105,0.0009755721,0.001758581,0.001182651,0.001415709,0.0003668044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001480371,"about_ca_system_score_gemma":0.002030904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005348794,"about_ca_topic_score_gemma":0.00597776,"domain_scores_codex":[0.9995707,0.0001961311,0.00001708197,0.00005678801,0.00007909991,0.00008020522],"domain_scores_gemma":[0.9978507,0.001705377,0.0001207816,0.0001069091,0.0001271294,0.00008913328],"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.0001034626,0.00005426816,0.000160829,0.00007211405,0.00002364379,0.00003099452,0.0000488532,0.9410473,0.0002241631,0.02065863,0.001802538,0.03577323],"study_design_scores_gemma":[0.00003246842,0.00001213554,0.00003581663,0.000006321938,0.000005412,0.000008181609,0.00001053974,0.9838173,0.00008240429,0.01560267,0.0003830816,0.00000368582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03033133,0.00099685,0.9623837,0.0003870415,0.0001043297,0.00009510534,0.00012361,0.0003757997,0.005202348],"genre_scores_gemma":[0.4426927,0.000788367,0.5505608,0.0001660782,0.0001280129,0.000347134,0.0002723669,0.0001691208,0.004875382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005348794,"threshold_uncertainty_score":0.01114345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1556504363","doi":"10.3233/ica-2002-9306","title":"A reconfigurable concurrent function block model and its implementation in real-time Java","year":2002,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada; Athabasca University; University of Calgary","funders":"","keywords":"Java; Computer science; Block (permutation group theory); Function (biology); Programming language; Mathematics","authors":[{"name":"Robert W. Brennan","is_ca":true},{"name":"Xiaokun Zhang","is_ca":true},{"name":"Yuefei Xu","is_ca":true},{"name":"Douglas H. Norrie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01472859796471018,"gpt":0.2166736728100674,"spread":0.2019450748453572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008027569,0.0004280328,0.0003025866,0.0003896343,0.000387522,0.001293121,0.001637559,0.0007326782,0.004338157],"category_scores_gemma":[0.001513959,0.0004043545,0.0007026926,0.0003163871,0.0006679301,0.001696133,0.0005073855,0.0009782466,0.001166786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005686979,"about_ca_system_score_gemma":0.00104084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004895237,"about_ca_topic_score_gemma":0.004148185,"domain_scores_codex":[0.9996667,0.00006364856,0.00002940559,0.00006184936,0.0001251094,0.00005324715],"domain_scores_gemma":[0.9994959,0.0001640481,0.00005460315,0.0001617023,0.00008510661,0.00003877663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008340807,0.0004221754,0.002307224,0.0002881299,0.00008022779,0.000746967,0.0005553558,0.3865621,0.04116416,0.43499,0.004566113,0.1274834],"study_design_scores_gemma":[0.0001769654,0.0001646553,0.0002869294,0.00003452772,0.0000648812,0.0002094794,0.00002734132,0.9247724,0.01519614,0.03288401,0.0261465,0.00003611087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01179509,0.00009695973,0.9800908,0.0001050703,0.00004839453,0.00009219224,0.00009227791,0.002674007,0.005005219],"genre_scores_gemma":[0.4089693,0.0003308764,0.5797001,0.0001303908,0.0000478919,0.0005355696,0.0003937334,0.0007142031,0.009177983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004895237,"threshold_uncertainty_score":0.01451254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035028561","doi":"10.1080/07408170490257871","title":"Exact algorithms for the job sequencing and tool switching problem","year":2004,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canada Research Chairs","keywords":"Computer science; Algorithm","authors":[{"name":"Juan‐José Salazar‐González","is_ca":false},{"name":"Frédéric Semet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01964753304419908,"gpt":0.2374291014801227,"spread":0.2177815684359236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001890851,0.001733488,0.001616939,0.001374433,0.001168149,0.002691951,0.002318048,0.002033607,0.01241742],"category_scores_gemma":[0.00878365,0.001071133,0.001123097,0.00320021,0.001117554,0.003292884,0.001624863,0.002808578,0.002103632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002819133,"about_ca_system_score_gemma":0.004158716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008816683,"about_ca_topic_score_gemma":0.01018886,"domain_scores_codex":[0.9979426,0.0005460496,0.0001024215,0.0003080934,0.0006524416,0.0004483704],"domain_scores_gemma":[0.9963017,0.002694631,0.0002720887,0.0003029536,0.0003386305,0.0000900255],"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.0002018342,0.0002559388,0.0003097774,0.0002804128,0.00004471411,0.00005492083,0.0001198823,0.7147115,0.001024078,0.09003069,0.01065388,0.1823123],"study_design_scores_gemma":[0.0001225393,0.0000430953,0.0001275382,0.00002740872,0.00001731185,0.00003969046,0.00004661157,0.9074882,0.000452698,0.088511,0.003110633,0.0000132825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00783604,0.001080505,0.9775376,0.0004728976,0.0001027904,0.0001414727,0.0002772645,0.0009603683,0.01159108],"genre_scores_gemma":[0.1409456,0.001486816,0.8492708,0.0002630264,0.0001821865,0.0005225637,0.000871818,0.0003373704,0.006119929],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01241742,"threshold_uncertainty_score":0.04154038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046059743","doi":"10.1016/j.cor.2005.02.047","title":"Multi-item dynamic production-distribution planning in process industries with divergent finishing stages","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Bottleneck; Mathematical optimization; Computer science; Production (economics); Process (computing); Linear programming; Production planning; Piecewise linear function; Integer programming; Piecewise; Mathematics","authors":[{"name":"Nafee Rizk","is_ca":true},{"name":"Alain Martel","is_ca":true},{"name":"Sophie D’Amours","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05081746576595451,"gpt":0.3466062186514448,"spread":0.2957887528854903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001640791,0.001103872,0.002276176,0.001041922,0.001178037,0.001538033,0.00193098,0.00141435,0.002434695],"category_scores_gemma":[0.002617917,0.001782961,0.001149817,0.002203811,0.001043921,0.001759468,0.00111408,0.001045127,0.0002433205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001620189,"about_ca_system_score_gemma":0.001165918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01086749,"about_ca_topic_score_gemma":0.00995371,"domain_scores_codex":[0.9993432,0.000233606,0.00002950685,0.0001347594,0.0001176685,0.0001411281],"domain_scores_gemma":[0.998395,0.001118812,0.0001642216,0.00006139691,0.0001459839,0.0001145055],"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.00007454632,0.00003079884,0.0002278478,0.00003290611,0.00001343007,0.00006308925,0.00001649971,0.9945688,0.0003942043,0.001462972,0.00007554065,0.003039437],"study_design_scores_gemma":[0.00001194802,0.00004547351,0.0001420289,0.000003069121,0.000008892838,0.000008269826,0.0000120696,0.9975075,0.0002855535,0.00189154,0.00007785044,0.000005898365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2905014,0.0005174541,0.7020307,0.0002671466,0.00005379648,0.0001924003,0.0002459003,0.0001742022,0.006016933],"genre_scores_gemma":[0.9196496,0.0002648768,0.07546587,0.00002822299,0.0000190233,0.0001811606,0.0001884935,0.00004171071,0.004161065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01086749,"threshold_uncertainty_score":0.02160841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4302378732","doi":"10.1007/978-0-387-09421-2","title":"Level Crossing Methods in Stochastic Models","year":2008,"lang":"en","type":"book","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Markov chain; Queue; Computer science; Queueing theory; Service (business); Operations research; Real-time computing; Mathematics; Computer network; Business; Machine learning; Marketing","authors":[{"name":"Percy H. Brill","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1399341142666061,"gpt":0.456075938194698,"spread":0.316141823928092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005499778,0.001359908,0.002215539,0.001829019,0.0007658474,0.002305858,0.00236472,0.002206111,0.007512989],"category_scores_gemma":[0.01293248,0.001265313,0.001807834,0.002980497,0.00190637,0.00331966,0.002014231,0.004907678,0.001800537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001567315,"about_ca_system_score_gemma":0.001143787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002652025,"about_ca_topic_score_gemma":0.002582791,"domain_scores_codex":[0.9980596,0.001229992,0.00007345086,0.0001616222,0.0003887016,0.00008666379],"domain_scores_gemma":[0.9935027,0.005139336,0.0002644296,0.0003891359,0.0005035371,0.0002008266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002659328,0.00003718301,0.0001979648,0.00012633,0.00007972564,0.00004577629,0.00007016117,0.1779779,0.0003339849,0.7765365,0.006734523,0.03783321],"study_design_scores_gemma":[0.00001194725,0.00001289408,0.00007136617,0.00002626366,0.00001584496,0.00002430894,0.000008674443,0.6132538,0.0001112257,0.3820667,0.004381642,0.00001538455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001415972,0.001578303,0.992452,0.0002300317,0.0001564412,0.00001134056,0.00003589849,0.0001382517,0.003981876],"genre_scores_gemma":[0.184316,0.007750247,0.75995,0.0005260074,0.001219057,0.0004348425,0.0005627841,0.001110525,0.0441306],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007512989,"threshold_uncertainty_score":0.02908599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100308419","doi":"10.1016/s0004-3702(00)00035-7","title":"Constraint-directed techniques for scheduling alternative activities","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Schedule; Constraint programming; Mathematics","authors":[{"name":"J. Christopher Beck","is_ca":false},{"name":"Mark S. Fox","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03535660262591858,"gpt":0.2865996582321427,"spread":0.2512430556062241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443996,0.001963695,0.001269534,0.001961388,0.001235919,0.001806454,0.003269543,0.001340025,0.00557545],"category_scores_gemma":[0.005798886,0.001109391,0.001637836,0.004489064,0.001225083,0.001805405,0.001504304,0.002987934,0.0008275676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001643719,"about_ca_system_score_gemma":0.003051033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01452218,"about_ca_topic_score_gemma":0.02407312,"domain_scores_codex":[0.998385,0.0005657373,0.00009348202,0.0002084888,0.0006209638,0.000126521],"domain_scores_gemma":[0.9962844,0.002623099,0.0002631391,0.0003217928,0.0004031455,0.0001044597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000193555,0.0002545344,0.0003870511,0.0005019358,0.0001682877,0.000127676,0.0001894276,0.7226516,0.002264095,0.07974155,0.006272513,0.1872478],"study_design_scores_gemma":[0.00006493258,0.00004945674,0.0001102445,0.00005734851,0.00006651185,0.00004974932,0.00004473971,0.9335859,0.001695693,0.05715282,0.007103687,0.00001898279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003476562,0.0003012261,0.9913993,0.0001170973,0.00004871112,0.0001705935,0.0001534729,0.000298363,0.004034587],"genre_scores_gemma":[0.08388708,0.000792329,0.9110104,0.0001662419,0.00004387425,0.000476467,0.0006006756,0.0001646062,0.002858268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01452218,"threshold_uncertainty_score":0.02887535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972249265","doi":"10.1016/j.ejor.2015.01.003","title":"Single machine scheduling with two competing agents and equal job processing times","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Time complexity; Computer science; Scheduling (production processes); Job shop scheduling; Single-machine scheduling; Computational complexity theory; Mathematical optimization; Set (abstract data type); Algorithm; Mathematics; Schedule","authors":[{"name":"Daniel Oron","is_ca":false},{"name":"Dvir Shabtay","is_ca":false},{"name":"George Steiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1016540663951278,"gpt":0.3421405488960593,"spread":0.2404864825009315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003494087,0.001605254,0.003493816,0.001255755,0.001527303,0.002416943,0.002903619,0.002899302,0.003432995],"category_scores_gemma":[0.008145416,0.001640524,0.001279714,0.00182529,0.001349792,0.002187892,0.001576889,0.001522301,0.0006777999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001169731,"about_ca_system_score_gemma":0.001431969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001772113,"about_ca_topic_score_gemma":0.001381031,"domain_scores_codex":[0.9973757,0.001039231,0.0001684439,0.0005207501,0.0004111521,0.0004846286],"domain_scores_gemma":[0.9929116,0.004420692,0.0007520546,0.0005964258,0.0005866091,0.0007325094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001620172,0.000297522,0.0007251151,0.0002332504,0.0001379431,0.0004100105,0.00008983253,0.9650226,0.004993739,0.009631133,0.0009486107,0.01589011],"study_design_scores_gemma":[0.0001752888,0.0001917857,0.0002507359,0.000005529571,0.00003035715,0.0000615774,0.00002347761,0.9911358,0.001048921,0.006800357,0.0002563559,0.00001973517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.413831,0.0009547711,0.5749965,0.0008588295,0.0006550981,0.0003795697,0.000245744,0.0005238566,0.007554539],"genre_scores_gemma":[0.9088406,0.0001576436,0.08561166,0.00007264845,0.0001671877,0.0002216324,0.00008854247,0.00006668562,0.004773385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003494087,"threshold_uncertainty_score":0.01847869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087393302","doi":"10.1111/j.1467-8640.2005.00278.x","title":"APPLYING MACHINE LEARNING TO LOW-KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS","year":2005,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Irish Research Council; Science Foundation Ireland","keywords":"Computer science; Machine learning; Domain knowledge; Algorithm; Artificial intelligence; Control (management); Set (abstract data type); Optimization algorithm; Scheduling (production processes); Mathematical optimization; Mathematics","authors":[{"name":"Tom Carchrae","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01517091568407795,"gpt":0.2613674780904295,"spread":0.2461965624063516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003035626,0.000888443,0.001102578,0.0007342257,0.0005798413,0.001783829,0.001776348,0.0008829807,0.0009743423],"category_scores_gemma":[0.01506964,0.0003870139,0.0003928089,0.0005706077,0.002406474,0.00202921,0.001255702,0.001722665,0.0001781661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001638506,"about_ca_system_score_gemma":0.001444447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003004597,"about_ca_topic_score_gemma":0.002432436,"domain_scores_codex":[0.9981838,0.0006733561,0.00009489871,0.0003888484,0.0004851774,0.0001739056],"domain_scores_gemma":[0.9909918,0.006423534,0.0009189711,0.0008022062,0.0007045644,0.000158851],"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.00009714843,0.0001475937,0.0009160997,0.00009951116,0.00006042119,0.00005562292,0.00008823956,0.8944625,0.00314801,0.02759527,0.0003388048,0.07299085],"study_design_scores_gemma":[0.000008491729,0.00002567809,0.0000933753,0.000004541079,0.000005138518,0.000004531829,0.000004465273,0.9758866,0.001335168,0.02244567,0.0001814838,0.000004854456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02968604,0.0001709421,0.9674733,0.000285259,0.00002559972,0.00003867444,0.00001093423,0.0002935525,0.00201567],"genre_scores_gemma":[0.8798007,0.00017601,0.118424,0.0001662878,0.00009705682,0.0001211249,0.0000376095,0.00005625528,0.001120932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003035626,"threshold_uncertainty_score":0.01605409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}