{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":164,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":164,"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"},"query_hash":"551296308a21","filters":{"topic":"Resource-Constrained Project Scheduling"}},"results":[{"id":"W2105760447","doi":"10.1061/(asce)0733-9364(2001)127:3(183)","title":"Cost Optimization in Projects with Repetitive Nonserial Activities","year":2001,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Crew; Scheduling (production processes); Operations research; Novelty; Total cost; Software; Reliability engineering; Engineering; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.03584861632909488,"gpt":0.2890536171455027,"spread":0.2532050008164078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001885,0.0001010409,0.0002013999,0.0007787927,0.00004159756,0.000155887,0.0001084292,0.0000337511,0.00002952686],"category_scores_gemma":[0.000192762,0.00007589082,0.00003346193,0.0005209105,0.00006024371,0.000419742,0.00002978873,0.000140227,6.33012e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005205712,"about_ca_system_score_gemma":0.00003324744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002990387,"about_ca_topic_score_gemma":0.000003421915,"domain_scores_codex":[0.998749,0.00004639115,0.0004422016,0.0001514522,0.0004746648,0.0001362983],"domain_scores_gemma":[0.9992941,0.0001488956,0.0002824451,0.0001057135,0.0001140031,0.00005486917],"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.0002951634,0.00002372889,0.005379486,0.00001920109,0.0000595457,0.000188601,0.0005946686,0.9352342,0.00009463081,0.001595337,0.00003323942,0.05648214],"study_design_scores_gemma":[0.01970434,0.002043013,0.05104965,0.002792661,0.0003633966,0.02494472,0.0988516,0.7273409,0.002497641,0.001183313,0.0672655,0.001963268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5501083,0.00004243674,0.4463824,0.0002390813,0.0004043957,0.0002426043,8.683464e-7,0.00001767463,0.002562284],"genre_scores_gemma":[0.8808571,0.000286501,0.1185762,0.00001974207,0.0001214381,0.000008593569,3.755062e-7,0.000009674735,0.0001203726],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3307488,"threshold_uncertainty_score":0.3094738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044479004","doi":"10.1061/(asce)0733-9364(2003)129:6(698)","title":"Resource Optimization Using Combined Simulation and Genetic Algorithms","year":2003,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Genetic algorithm; Software; Set (abstract data type); Mathematical optimization; Resource (disambiguation); Simulation modeling; Simulation software; Industrial engineering; Engineering; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0389053613313472,"gpt":0.3042320755583036,"spread":0.2653267142269564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009303987,0.0001019904,0.0001824316,0.00051505,0.00008564014,0.0001786345,0.00007708313,0.000042108,0.0000172759],"category_scores_gemma":[0.0003654141,0.00008849295,0.00004021825,0.0003247983,0.000048158,0.0002064126,0.00002764184,0.0001006211,3.794644e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000287499,"about_ca_system_score_gemma":0.00001256388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.058299e-7,"about_ca_topic_score_gemma":5.374521e-8,"domain_scores_codex":[0.9986598,0.00007252105,0.000558821,0.0001518322,0.0004407572,0.0001163054],"domain_scores_gemma":[0.999162,0.0001855931,0.0003161977,0.0001112955,0.0001396141,0.00008533857],"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.00001008643,0.000005137109,0.0007779078,0.00001208732,0.00003098803,0.00001219035,0.00008169018,0.9719734,0.00005485505,0.001112917,0.000005077553,0.02592372],"study_design_scores_gemma":[0.0006481069,0.00004936331,0.001184587,0.00004615706,0.00004659368,0.0005583448,0.0006328835,0.9925719,0.00004793208,0.00044299,0.003671282,0.0000998387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2516102,0.0001680916,0.7475903,0.00004804223,0.0002228476,0.00008750956,3.459393e-7,0.00001116385,0.0002614882],"genre_scores_gemma":[0.5897508,0.00005782097,0.4101051,0.00001387187,0.00003999495,5.527329e-7,1.442226e-7,0.000007521536,0.00002420736],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3381406,"threshold_uncertainty_score":0.3608638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2894184593","doi":"10.1080/00207543.2018.1524168","title":"A review of methods, techniques and tools for project planning and control","year":2018,"lang":"en","type":"review","venue":"International Journal of Production Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; SNC-Lavalin (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Project planning; Project management; Control (management); Schedule; Project management triangle; Automated planning and scheduling; Computer science; Management science; Scheduling (production processes); Operations research; Risk analysis (engineering); Plan (archaeology); Process management; Engineering; Systems engineering; Operations management; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.740716950937955,"gpt":0.7034723258423267,"spread":0.03724462509562831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.05862214,0.0002134958,0.00144942,0.002385717,0.0001076914,0.0005319965,0.001200678,0.0001680329,0.00002581446],"category_scores_gemma":[0.08522212,0.0001369951,0.0003781032,0.0007592941,0.0005136793,0.0007005798,0.000240156,0.0007807941,0.000001641471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001064329,"about_ca_system_score_gemma":0.001001826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004750395,"about_ca_topic_score_gemma":2.58948e-7,"domain_scores_codex":[0.992337,0.002471394,0.002332249,0.0005375245,0.002082404,0.0002394492],"domain_scores_gemma":[0.9792755,0.008950094,0.002358761,0.0003427836,0.008981138,0.00009176606],"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.00008821477,0.00002261333,0.000004854507,0.007999649,0.0002357656,0.00000766089,0.0001009683,1.300401e-7,0.0000293604,0.00009376107,0.007393991,0.984023],"study_design_scores_gemma":[0.0001903806,0.0002960271,8.876377e-7,0.07530311,0.0001072288,0.00197724,0.0001918601,0.000007659746,0.0001793932,0.001149955,0.9204927,0.000103553],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000009363772,0.9877714,0.008548856,0.001030777,0.0005642565,0.001769677,0.00003985107,0.00000750056,0.0002583101],"genre_scores_gemma":[0.000006789115,0.927069,0.07088617,0.00003193899,0.001737085,0.00008890722,0.000004170376,0.00002122239,0.0001546873],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9839195,"threshold_uncertainty_score":0.9693466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155750016","doi":"10.1061/(asce)0733-9364(2000)126:3(219)","title":"Simplified CPM/PERT Simulation Model","year":2000,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Critical path method; Computer science; Complement (music); Criticality; Schedule; Project management; Reliability engineering; Operations research; Systems engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04317147818980395,"gpt":0.320221638407086,"spread":0.2770501602172821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016266,0.0001069011,0.0002014191,0.0004273646,0.00006668315,0.0001583473,0.0001698477,0.00004362575,0.0001429697],"category_scores_gemma":[0.0001472656,0.00008551082,0.00008442355,0.000281762,0.0000380766,0.0003169455,0.00002437401,0.0001355759,0.00001021337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002815707,"about_ca_system_score_gemma":0.00001501922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.046623e-7,"about_ca_topic_score_gemma":1.005865e-7,"domain_scores_codex":[0.9984469,0.00002619388,0.0006328597,0.0001516843,0.0006034951,0.0001388993],"domain_scores_gemma":[0.9992634,0.0001624522,0.0001947613,0.000156606,0.0001280334,0.00009474569],"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.00002101508,0.000005491238,0.0000601184,0.000006766075,0.00002750396,0.000006968879,0.00009417764,0.7666928,0.0000945117,0.001296084,0.00005507883,0.2316395],"study_design_scores_gemma":[0.0004779802,0.00003058144,0.0007774518,0.00003635521,0.0000290261,0.0001754457,0.0002779385,0.9784319,0.00004367071,0.001872113,0.01774399,0.0001035798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5023365,0.00009791707,0.4922121,0.0002545143,0.0002754985,0.0001024068,0.00000118508,0.00003012217,0.004689784],"genre_scores_gemma":[0.9494264,0.0001358096,0.04977892,0.00005174685,0.00009834697,0.000001201709,2.232696e-7,0.000008129896,0.0004992106],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4470899,"threshold_uncertainty_score":0.348703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967901027","doi":"10.1061/(asce)0733-9364(2000)126:6(414)","title":"Algorithm for Scheduling with Multiskilled Constrained Resources","year":2000,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Economic shortage; Computer science; Scheduling (production processes); Heuristic; Software; Genetic algorithm scheduling; Operations research; Resource (disambiguation); Job shop scheduling; Industrial engineering; Mathematical optimization; Flow shop scheduling; Artificial intelligence; Engineering; Schedule; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01746976352344148,"gpt":0.2768846448856659,"spread":0.2594148813622245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001553304,0.0001777826,0.0003619163,0.0005546131,0.0001290672,0.0002491895,0.0002381221,0.00005713431,0.0001119471],"category_scores_gemma":[0.0001791225,0.0001286249,0.0001178581,0.0003784472,0.0001356304,0.0002717489,0.00002333517,0.0001732978,0.000003347936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000027616,"about_ca_system_score_gemma":0.0000256375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001411363,"about_ca_topic_score_gemma":3.872151e-7,"domain_scores_codex":[0.9980562,0.00003921431,0.0007690975,0.0002469114,0.0006504608,0.0002381577],"domain_scores_gemma":[0.9986889,0.0003910527,0.0003427429,0.0001774024,0.0002534706,0.0001464834],"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.00008771033,0.00001572554,0.0001337542,0.00002298995,0.0001648275,0.00003278223,0.0002605779,0.06539351,0.00008776467,0.0007576864,0.00003274074,0.9330099],"study_design_scores_gemma":[0.0123011,0.001046771,0.002594208,0.0008176974,0.0004356065,0.006546951,0.01084691,0.7411351,0.0007078408,0.002355921,0.220222,0.0009898532],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3294394,0.0002110276,0.6684068,0.0002685953,0.0002796144,0.0002950797,0.000005551405,0.00003953588,0.001054416],"genre_scores_gemma":[0.214354,0.0001530054,0.784848,0.00003869635,0.0002010832,0.00001014841,5.803385e-7,0.00001763253,0.0003768767],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9320201,"threshold_uncertainty_score":0.5245171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155654644","doi":"10.1139/l02-034","title":"Application of genetic algorithms to construction scheduling with or without resource constraints","year":2002,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Operator (biology); Mathematical optimization; Computer science; Genetic algorithm; Fitness function; Key (lock); Resource leveling; Genetic algorithm scheduling; Genetic operator; Resource constraints; Algorithm; Dynamic priority scheduling; Mathematics; Two-level scheduling; Distributed computing; Resource allocation; Meta-optimization; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.03595200893317288,"gpt":0.2696699419705341,"spread":0.2337179330373612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147691,0.0001983191,0.0004688415,0.001277948,0.00009650783,0.0001454778,0.0006025737,0.0000978201,0.0004830701],"category_scores_gemma":[0.001732751,0.0001534185,0.00009517317,0.001258306,0.0002193437,0.0002078329,0.00001706551,0.0003258195,0.00001830367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001298536,"about_ca_system_score_gemma":0.0004386654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001964816,"about_ca_topic_score_gemma":0.005794114,"domain_scores_codex":[0.9974761,0.00005567658,0.001015798,0.0002715379,0.0007812637,0.0003996326],"domain_scores_gemma":[0.9973787,0.0003545806,0.0005212836,0.0003626657,0.0005488701,0.0008339043],"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.00005065147,0.00001414965,0.04407187,0.00003381211,0.0001018192,0.0001502403,0.002926939,0.7799574,0.002430074,0.0002813526,0.0002200245,0.1697617],"study_design_scores_gemma":[0.002950411,0.001107883,0.01339106,0.001210281,0.0001672565,0.01090646,0.008424105,0.922948,0.003288598,0.0003365972,0.03402158,0.001247777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2514501,0.0002727633,0.7457772,0.0002983231,0.0001976164,0.000258901,0.00001293876,0.00001722,0.001714916],"genre_scores_gemma":[0.8898336,0.000003108098,0.1098685,0.00005137706,0.0001698059,0.000004184189,3.363769e-7,0.00002641652,0.00004271253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6383834,"threshold_uncertainty_score":0.6256227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141739264","doi":"10.1061/(asce)0733-9364(2008)134:4(253)","title":"Efficient Repetitive Scheduling for High-Rise Construction","year":2008,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Operations research; Industrial engineering; Distributed computing; Mathematical optimization; Real-time computing; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0286964893377416,"gpt":0.2801634191625897,"spread":0.2514669298248481,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630509,0.0001642064,0.0003449423,0.0008115064,0.0002041997,0.0001047265,0.0001926371,0.00006586101,0.00002050345],"category_scores_gemma":[0.0007505341,0.0001378075,0.0001455556,0.0004185469,0.0001830219,0.000153086,0.00005616574,0.0001905554,0.000003521043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000636451,"about_ca_system_score_gemma":0.00004347187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001640372,"about_ca_topic_score_gemma":1.752527e-7,"domain_scores_codex":[0.9978442,0.00004532549,0.0009139589,0.0002685632,0.0007074599,0.0002205541],"domain_scores_gemma":[0.9982671,0.0003674637,0.0005782529,0.0001936386,0.0004605658,0.0001330297],"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.00023177,0.00005481952,0.002099102,0.0001065967,0.0003301499,0.00012665,0.0006593952,0.7896373,0.001403224,0.07388553,0.0002290288,0.1312364],"study_design_scores_gemma":[0.01900251,0.001730499,0.03501663,0.001621806,0.0009677558,0.04043693,0.0292667,0.7636731,0.01195133,0.0173551,0.07642144,0.002556229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5661624,0.000156424,0.4318874,0.0002106482,0.001082499,0.0001808805,0.000003177169,0.00002558925,0.0002909997],"genre_scores_gemma":[0.692428,0.0001375852,0.3071289,0.00001653493,0.0002120576,0.000006932787,3.918546e-7,0.00001103103,0.00005852907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1286802,"threshold_uncertainty_score":0.5619628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051204535","doi":"10.1016/j.ejor.2005.10.012","title":"Multi-objectives Tabu Search based algorithm for progressive resource allocation","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":67,"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":"Computer science; Tabu search; Resource allocation; Scheduling (production processes); Operations research; Schedule; Task (project management); Mathematical optimization; Set (abstract data type); Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2167307243235256,"gpt":0.4641941235331106,"spread":0.247463399209585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04337619,0.0001867615,0.0003123457,0.001356494,0.0008058445,0.001228645,0.001429231,0.00005270435,0.0002877809],"category_scores_gemma":[0.009041531,0.0001370975,0.0002380221,0.001286719,0.0004981473,0.0005838446,0.0001631069,0.0008332156,0.0001493984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001666846,"about_ca_system_score_gemma":0.00120043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009666061,"about_ca_topic_score_gemma":0.000003139859,"domain_scores_codex":[0.9876993,0.004876062,0.00140566,0.0005239033,0.004916381,0.0005786583],"domain_scores_gemma":[0.9863355,0.004900929,0.000396148,0.0003914137,0.007739631,0.0002363948],"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.001065712,0.001247624,0.002481753,0.0000298346,0.000135767,0.0006803904,0.002595982,0.06248553,0.05165124,0.002772017,0.03279844,0.8420557],"study_design_scores_gemma":[0.007890338,0.002572854,0.03577762,0.0003028317,0.00002474041,0.0004511253,0.006548378,0.7957063,0.03020231,0.001153758,0.1187355,0.0006342245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07807767,0.001012177,0.9031982,0.006187182,0.0002031975,0.001285563,0.00007286073,0.00002711653,0.009935957],"genre_scores_gemma":[0.5505399,0.000004646704,0.4451248,0.0001341174,0.001427243,0.00001925812,0.00002833579,0.0000522162,0.002669453],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8414215,"threshold_uncertainty_score":0.9998082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975246199","doi":"10.1061/(asce)0733-9364(2003)129:6(664)","title":"Optimized Scheduling of Linear Projects","year":2003,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":58,"is_retracted":false,"has_abstract":true,"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":"Bidding; Computer science; Scheduling (production processes); Crew; Linear programming; Operations research; Software; Crew scheduling; Process (computing); Industrial engineering; Engineering; Operations management; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03945352496548811,"gpt":0.3002256918817797,"spread":0.2607721669162916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002487235,0.0001183324,0.000332237,0.0007393776,0.00005146863,0.00006700362,0.0001791858,0.00004762364,0.00003590887],"category_scores_gemma":[0.001098836,0.00009296198,0.0001174961,0.0004935043,0.00006662005,0.0002162277,0.00003628145,0.0001714839,0.000001875362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002117265,"about_ca_system_score_gemma":0.00004105227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.887681e-7,"about_ca_topic_score_gemma":4.731006e-8,"domain_scores_codex":[0.9980925,0.00007130326,0.0008759837,0.000154923,0.0006533352,0.0001519209],"domain_scores_gemma":[0.9986925,0.0002237047,0.0005427504,0.0001748892,0.0002760242,0.00009014193],"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.0001067955,0.00005676323,0.001592677,0.0001693188,0.0003557129,0.0000641306,0.0007180191,0.8813429,0.002642311,0.04836489,0.00009922672,0.06448723],"study_design_scores_gemma":[0.02546219,0.001686937,0.006018401,0.002892378,0.001178965,0.01293459,0.05550046,0.6424152,0.06175191,0.01355618,0.1740112,0.002591593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4498217,0.0003761553,0.5457373,0.0001198935,0.0008194331,0.0001734991,8.772115e-7,0.00001959209,0.002931594],"genre_scores_gemma":[0.512991,0.0001419554,0.4867409,0.000009502225,0.00004575656,0.000001381289,7.477023e-8,0.00000720653,0.0000622711],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2389278,"threshold_uncertainty_score":0.379088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2555012946","doi":"10.1108/ecam-05-2014-0069","title":"Optimized scheduling and buffering of repetitive construction projects under uncertainty","year":2016,"lang":"en","type":"article","venue":"Engineering Construction & Architectural Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Scheduling (production processes); Computer science; Construction management; Operations research; Industrial engineering; Systems engineering; Risk analysis (engineering); Engineering; Operations management; Business; Civil engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0304027809900025,"gpt":0.2825019141844581,"spread":0.2520991331944556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189162,0.0003256588,0.0004640879,0.0009210047,0.0001479549,0.0001374441,0.0003408147,0.0000893223,0.0001227838],"category_scores_gemma":[0.0008681128,0.0002255647,0.0001487228,0.0007323535,0.0004722014,0.0002928905,0.0002962054,0.0002130272,0.00001083634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001277068,"about_ca_system_score_gemma":0.00003676058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001949639,"about_ca_topic_score_gemma":0.00000197586,"domain_scores_codex":[0.9969283,0.0001373821,0.0008988943,0.0007684728,0.0008377741,0.0004292147],"domain_scores_gemma":[0.9979118,0.0008701729,0.0003758249,0.0005107606,0.000188545,0.0001428785],"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.0001990058,0.00001425043,0.002109055,0.0001001837,0.0002381031,0.0000141342,0.0005807795,0.4352959,0.01489432,0.04376792,0.000004459185,0.5027819],"study_design_scores_gemma":[0.0318565,0.001446516,0.09185801,0.007577281,0.0009950841,0.007630882,0.05332262,0.5952608,0.09711899,0.09921881,0.00607928,0.007635259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6276028,0.0000470748,0.3698753,0.0004734198,0.0004892438,0.0004167673,0.000008101367,0.0001490642,0.0009383425],"genre_scores_gemma":[0.7374533,0.00002755019,0.2622936,0.00001658083,0.00007596381,0.00002864136,0.00000131146,0.00002048968,0.00008255606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4951466,"threshold_uncertainty_score":0.9198262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969988169","doi":"10.1061/(asce)me.1943-5479.0000338","title":"Multimode Resource-Constrained Scheduling and Leveling for Practical-Size Projects","year":2014,"lang":"en","type":"article","venue":"Journal of Management in Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Golder Associates (Canada)","funders":"","keywords":"Solver; Computer science; Mathematical optimization; Metaheuristic; Scheduling (production processes); Job shop scheduling; Constraint programming; Software; Heuristics; Project management; Heuristic; Industrial engineering; Operations research; Systems engineering; Algorithm; Stochastic programming; Schedule; Mathematics; Engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.07902712514998302,"gpt":0.3579501755480102,"spread":0.2789230503980272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0106567,0.0002356292,0.0005157086,0.001008214,0.00008447627,0.0003340916,0.0004717514,0.0000986459,0.0000135099],"category_scores_gemma":[0.01700255,0.000197048,0.0001580311,0.0006018379,0.00005092436,0.0005020112,0.0001623431,0.000440523,0.000003183093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007332802,"about_ca_system_score_gemma":0.00005418565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002119342,"about_ca_topic_score_gemma":0.000001830689,"domain_scores_codex":[0.9967135,0.0001312632,0.00138433,0.0003786107,0.0009384262,0.0004538864],"domain_scores_gemma":[0.9934841,0.005233491,0.0006042555,0.0003062609,0.0002101047,0.0001617885],"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.0003312455,0.0001398566,0.003327738,0.0003744214,0.0002459342,0.0001375916,0.002202603,0.7934716,0.00332204,0.0127885,0.0002372703,0.1834212],"study_design_scores_gemma":[0.003077234,0.0001903624,0.002335196,0.0004930584,0.00007173979,0.0001956239,0.003910894,0.9742925,0.000488199,0.002760471,0.01180571,0.000379046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3158336,0.0001208762,0.6802236,0.001304957,0.0002856315,0.0005076342,0.000001552115,0.00003388938,0.001688295],"genre_scores_gemma":[0.585746,0.00001451857,0.4139065,0.00007899591,0.0001690455,0.00001002495,2.231804e-7,0.00002119675,0.00005349431],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2699125,"threshold_uncertainty_score":0.9912776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2944277995","doi":"10.1108/ecam-05-2018-0217","title":"Multi-objective optimization for repetitive scheduling under uncertainty","year":2019,"lang":"en","type":"article","venue":"Engineering Construction & Architectural Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Schedule; Computer science; Mathematical optimization; Duration (music); Scheduling (production processes); Fuzzy logic; Genetic algorithm; Reliability engineering; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03050651757581384,"gpt":0.303171025998577,"spread":0.2726645084227631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001153876,0.0003181984,0.0003592128,0.0007942283,0.0001838497,0.0002839768,0.0004502574,0.00009105472,0.0002675976],"category_scores_gemma":[0.0007037041,0.000278976,0.0002318761,0.0008381004,0.00009655113,0.0002658076,0.0001829494,0.0002765121,0.00007541415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001974565,"about_ca_system_score_gemma":0.00003522651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000121497,"about_ca_topic_score_gemma":0.000003222701,"domain_scores_codex":[0.9971356,0.00009188893,0.0006846149,0.0008815442,0.000731027,0.0004752624],"domain_scores_gemma":[0.998025,0.0007774823,0.0002642904,0.0005510921,0.0002659338,0.0001162187],"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.00005971538,0.00001067652,0.0003974872,0.00003415448,0.0001004371,0.00000181548,0.0003117603,0.9611736,0.0005875981,0.005192071,0.000004283041,0.03212643],"study_design_scores_gemma":[0.001295936,0.00007075221,0.002026421,0.00008996367,0.0000337822,0.00005278758,0.002965073,0.9909971,0.0003837079,0.0009998804,0.0007074652,0.0003771744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2861752,0.00002469355,0.7103996,0.0002521921,0.001038074,0.001138798,0.00001271586,0.0002055469,0.0007531901],"genre_scores_gemma":[0.5370542,0.000002908356,0.4623446,0.00005575371,0.00009037171,0.0000750309,0.00001280776,0.0000259502,0.0003383729],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.250879,"threshold_uncertainty_score":0.9999663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062705997","doi":"10.1007/s00500-008-0337-5","title":"Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem","year":2008,"lang":"en","type":"article","venue":"Soft Computing","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":46,"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":"Benchmark (surveying); Job shop scheduling; Computer science; Crossover; Mathematical optimization; Algorithm; Scheduling (production processes); Schedule; Computational complexity theory; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2173452877011113,"gpt":0.4178145060016266,"spread":0.2004692183005153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.007999549,0.0005389038,0.0008470656,0.001047515,0.001868612,0.0006818376,0.001558667,0.0002839688,0.00005672935],"category_scores_gemma":[0.002160894,0.0004783075,0.0004111284,0.00205235,0.0006318945,0.0006591814,0.0004662751,0.0007085474,0.00004958337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001598993,"about_ca_system_score_gemma":0.001001268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008911913,"about_ca_topic_score_gemma":0.000005558623,"domain_scores_codex":[0.9923077,0.0007257782,0.00170457,0.001780811,0.001970168,0.001510924],"domain_scores_gemma":[0.9939245,0.003141491,0.0006174218,0.001021073,0.0009635146,0.0003320148],"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.000119304,0.000276835,0.002840419,0.00006371739,0.000115529,0.00006933017,0.02292006,0.08767954,0.02829403,0.0001789445,0.000140233,0.8573021],"study_design_scores_gemma":[0.001509466,0.0002273872,0.0001380863,0.0001704135,0.00002427458,0.000449181,0.006291837,0.9800974,0.008815959,0.0008997784,0.0006884695,0.0006878093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4379901,0.00004414081,0.5592026,0.00009918374,0.0001340218,0.001080783,0.00001653307,0.0002330164,0.001199668],"genre_scores_gemma":[0.4837402,5.998334e-7,0.5152292,0.0002165357,0.0006034621,0.00001797142,0.00001328904,0.0000601795,0.000118603],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8924178,"threshold_uncertainty_score":0.9997669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1942626595","doi":"10.15439/2015f273","title":"A new benchmark dataset for Multi-Skill Resource-Constrained Project Scheduling Problem","year":2015,"lang":"en","type":"article","venue":"Annals of Computer Science and Information Systems","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Benchmark (surveying); Scheduling (production processes); Heuristic; Greedy algorithm; Mathematical optimization; Job shop scheduling; Machine learning; Artificial intelligence; Schedule; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2576621045480103,"gpt":0.4199907239378667,"spread":0.1623286193898564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01744443,0.0002312347,0.0004843507,0.001291738,0.000310414,0.001734837,0.001372643,0.0001034514,0.000003440302],"category_scores_gemma":[0.003032083,0.0001720632,0.00008512904,0.002082988,0.0004742678,0.007578573,0.0003655516,0.0001303022,0.00002971775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002769226,"about_ca_system_score_gemma":0.00171587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001369771,"about_ca_topic_score_gemma":0.000002492652,"domain_scores_codex":[0.9947897,0.0001386342,0.001678188,0.0004681053,0.002395637,0.0005297649],"domain_scores_gemma":[0.9945111,0.0005316236,0.001046612,0.0006637731,0.002814453,0.0004324022],"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.0003151524,0.0001086717,0.001639107,0.0003183303,0.00008678253,0.000002852486,0.04722374,0.03581771,0.0002308114,0.02625557,0.2117852,0.6762161],"study_design_scores_gemma":[0.001351283,0.0004024538,0.0001655841,0.0001662159,0.000006967682,0.00007413273,0.005800777,0.7048216,0.0004938596,0.0004221908,0.2859797,0.0003152794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02265846,0.0002151869,0.9700043,0.001056182,0.0005869165,0.002101124,0.0005482675,0.00006726242,0.002762333],"genre_scores_gemma":[0.3926023,0.00001577857,0.6043959,0.002038247,0.0004432422,0.00008202193,0.0003016449,0.00001567985,0.0001051045],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6759008,"threshold_uncertainty_score":0.9993014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081463457","doi":"10.1139/l02-007","title":"An optimal construction resource leveling scheduling simulation model","year":2002,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Probabilistic logic; Resource leveling; Scheduling (production processes); Duration (music); Computer science; Resource (disambiguation); Operations research; Schedule; Mathematical optimization; Resource allocation; Engineering; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.08089126180476691,"gpt":0.3016304505964292,"spread":0.2207391887916623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002314418,0.0002108597,0.000355637,0.00146333,0.0002326503,0.0005195319,0.0006828405,0.0001527621,0.0005593412],"category_scores_gemma":[0.003430258,0.0002050737,0.000168505,0.0007524934,0.0000802974,0.001021837,0.00001501505,0.000566993,0.00001914061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000204008,"about_ca_system_score_gemma":0.0003531941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004923254,"about_ca_topic_score_gemma":0.001337162,"domain_scores_codex":[0.9972643,0.0000799844,0.001057774,0.0002865295,0.0008142487,0.000497141],"domain_scores_gemma":[0.9973014,0.0004747014,0.0004239968,0.0003679972,0.0005080928,0.0009238279],"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.000005741374,0.000003824866,0.0004980103,0.000003728555,0.0000149304,0.00004047786,0.001321231,0.9870688,0.0006336694,0.0001684311,0.00005339312,0.01018771],"study_design_scores_gemma":[0.000283335,0.00004713986,0.00009964245,0.00008151649,0.0000163394,0.000288085,0.0008670771,0.9956331,0.0001734081,0.0002349586,0.00206039,0.0002149911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3412702,0.0004176608,0.6561175,0.0001604852,0.0003133446,0.00006818791,0.000006666718,0.00002646603,0.001619451],"genre_scores_gemma":[0.9368747,0.000003188796,0.06260389,0.00005564904,0.0003887502,8.060994e-7,8.635377e-7,0.00003367603,0.00003844109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5956045,"threshold_uncertainty_score":0.8362662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3187738316","doi":"10.1108/ci-05-2018-0046","title":"Integrating critical chain project management with last planner system for linear scheduling of modular construction","year":2021,"lang":"en","type":"article","venue":"Construction Innovation","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Modular design; Earned value management; Schedule; Computer science; Scheduling (production processes); Planner; Operations research; Project management; Project planning; Duration (music); Reliability engineering; Systems engineering; Operations management; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07567651076534823,"gpt":0.3686380373144393,"spread":0.2929615265490911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327343,0.0002538262,0.0004676875,0.001174991,0.0003469817,0.0002409887,0.0002521738,0.0001787556,0.00003365207],"category_scores_gemma":[0.003560338,0.00021171,0.0001017332,0.004280192,0.0004919528,0.0005103083,0.00008319731,0.0002750635,0.00000723509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001327665,"about_ca_system_score_gemma":0.0003386353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006522614,"about_ca_topic_score_gemma":0.000004941436,"domain_scores_codex":[0.9960468,0.000230025,0.00157778,0.0007631524,0.001054423,0.0003277985],"domain_scores_gemma":[0.9942034,0.0007310079,0.0007783902,0.0005133378,0.003727919,0.00004596333],"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.000278826,0.00005688255,0.008853019,0.0005239656,0.0001500739,0.00002077905,0.000585395,0.005078313,0.0191038,0.854941,0.00005763234,0.1103503],"study_design_scores_gemma":[0.007741939,0.0007720079,0.001510428,0.003500449,0.0003839594,0.00449323,0.307665,0.3699962,0.2705628,0.0247732,0.006794123,0.001806696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3607677,0.00002543735,0.6352997,0.0002148216,0.0007969312,0.0005439747,0.000036767,0.0000986411,0.002216078],"genre_scores_gemma":[0.5586229,0.000001245313,0.4409742,0.00002721909,0.0001791702,0.00007471784,0.00004784105,0.0000187295,0.00005399568],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8301678,"threshold_uncertainty_score":0.8633282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168976754","doi":"10.1080/01446193.2015.1063676","title":"Enhanced heuristic for finance-based scheduling of construction projects","year":2015,"lang":"en","type":"article","venue":"Construction Management and Economics","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Scheduling (production processes); Computer science; Integer programming; Payment; Heuristic; Finance; Cash; Job shop scheduling; Linear programming; Cash flow; Operations research; Mathematical optimization; Economics; Engineering; Algorithm; Mathematics; Operating system; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.1135662989238217,"gpt":0.3207669187765104,"spread":0.2072006198526887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497896,0.0001827605,0.0003759772,0.0005044161,0.0001430735,0.0001920694,0.0002578106,0.00009245379,0.00002204103],"category_scores_gemma":[0.0005784917,0.0001793606,0.0001055322,0.0003206366,0.0004393927,0.0003286349,0.00008595345,0.00008436189,0.00001381553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006774721,"about_ca_system_score_gemma":0.0001356909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004574949,"about_ca_topic_score_gemma":0.000004804473,"domain_scores_codex":[0.9981014,0.00005839264,0.0008251449,0.0005551922,0.0002086276,0.0002513022],"domain_scores_gemma":[0.9983056,0.0003391124,0.0006127664,0.0003682564,0.0002789884,0.00009532693],"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.0007142656,0.00005962338,0.01908356,0.0002018323,0.0001518278,0.000002055076,0.000833729,0.07091419,0.0001783789,0.2015871,0.0002985951,0.7059749],"study_design_scores_gemma":[0.013376,0.0006888048,0.00249603,0.0002336468,0.0003092042,0.00009945983,0.04779597,0.6318948,0.01928552,0.2585554,0.02378382,0.001481408],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7182462,0.00006094031,0.2746641,0.0001450318,0.000818954,0.0006375416,0.00001698865,0.00003549865,0.0053748],"genre_scores_gemma":[0.7404532,0.00004069142,0.2591629,0.00004399699,0.00008801432,0.00004681398,0.000008200978,0.00001223469,0.0001439064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7044935,"threshold_uncertainty_score":0.7314112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086411192","doi":"10.1061/(asce)co.1943-7862.0000722","title":"Fast and Near-Optimum Schedule Optimization for Large-Scale Projects","year":2013,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Schedule; Computer science; Mathematical optimization; Metaheuristic; Scheduling (production processes); Set (abstract data type); Scale (ratio); Resource (disambiguation); Operations research; Engineering; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01978522260025422,"gpt":0.2704363473152965,"spread":0.2506511247150423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035225,0.0001152049,0.0002146222,0.0003616815,0.000121103,0.0004478473,0.0001225725,0.00004950851,0.00004930467],"category_scores_gemma":[0.0002318015,0.00009170389,0.00006154956,0.0002450882,0.00004905605,0.000483514,0.00005990206,0.0001090776,0.000002346895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002014518,"about_ca_system_score_gemma":0.0000197884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001057693,"about_ca_topic_score_gemma":2.63253e-7,"domain_scores_codex":[0.9987315,0.0000243766,0.000512982,0.0001814902,0.0003667892,0.0001828738],"domain_scores_gemma":[0.9990826,0.0001335848,0.0002775056,0.0001213824,0.0002765784,0.0001083141],"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.00004014738,0.00003686029,0.001678205,0.0001403714,0.0001373034,0.0000056677,0.000958625,0.8237261,0.000344541,0.00384652,0.0007240954,0.1683615],"study_design_scores_gemma":[0.001123393,0.0001094959,0.0012181,0.00007490194,0.00004265554,0.0002661945,0.003699161,0.9855927,0.0001181068,0.0003568282,0.007257679,0.0001407452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2253766,0.000134738,0.7729629,0.0004610606,0.0003736897,0.0003487809,0.000002066538,0.00002038421,0.0003197731],"genre_scores_gemma":[0.2885453,0.0001033445,0.7110505,0.00003702641,0.0001038407,0.00001808716,6.915012e-7,0.0000118558,0.0001293809],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1682208,"threshold_uncertainty_score":0.4318602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1689295453","doi":"10.1061/(asce)co.1943-7862.0001027","title":"Resource Supply-Demand Matching Scheduling Approach for Construction Workface Planning","year":2015,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scheduling (production processes); Workflow; Executable; Operations research; Schedule; Resource (disambiguation); Traverse; Operations management; Database; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05922927266322259,"gpt":0.3155213603290505,"spread":0.256292087665828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042006,0.0002123945,0.0004196298,0.0008492983,0.0001545611,0.0004081256,0.0003024532,0.00009707675,0.000006434217],"category_scores_gemma":[0.000622338,0.0001811652,0.0001213529,0.0004647122,0.0001056585,0.000472045,0.00009634155,0.0003013441,0.000001328599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007981616,"about_ca_system_score_gemma":0.00004688356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001059686,"about_ca_topic_score_gemma":5.228809e-8,"domain_scores_codex":[0.9974403,0.00008144991,0.0009913942,0.000316116,0.0008758134,0.000294901],"domain_scores_gemma":[0.9982259,0.0003509531,0.0006437384,0.0002191301,0.0003087127,0.0002515924],"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.0001415374,0.00001609267,0.001250951,0.00008355765,0.000140195,0.00001711471,0.001028476,0.9117069,0.0003064721,0.007144451,0.0003327211,0.07783157],"study_design_scores_gemma":[0.01251274,0.0008419587,0.002383305,0.001576523,0.0006984828,0.01291639,0.1571643,0.6458592,0.002674301,0.02110381,0.1403906,0.001878364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1688448,0.0005268577,0.8277097,0.0001990711,0.0006846095,0.0002603473,0.000002351568,0.00004459248,0.001727583],"genre_scores_gemma":[0.440479,0.00002454766,0.5590968,0.00002481652,0.0002797748,0.00000764917,0.000001744882,0.0000171197,0.00006851408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2716342,"threshold_uncertainty_score":0.7387701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085278007","doi":"10.1007/s10479-006-0149-x","title":"Time-cost trade-off via optimal control theory in Markov PERT networks","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Theory of computation; Mathematical optimization; Minification; Erlang (programming language); Markov decision process; Computer science; Optimal control; Control (management); Markov chain; Variance (accounting); Stochastic programming; Function (biology); Markov process; Mathematics; Statistics; Economics; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.2152292989356169,"gpt":0.4958663595598718,"spread":0.280637060624255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.05355899,0.0001780151,0.0004240574,0.001518814,0.0004322874,0.0003893296,0.001255826,0.0002090368,0.001836507],"category_scores_gemma":[0.009463204,0.0001406074,0.0001670267,0.002644355,0.0007930769,0.0005246805,0.0001653112,0.0008844687,0.0002826788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003815317,"about_ca_system_score_gemma":0.0003119782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008284338,"about_ca_topic_score_gemma":0.0001701698,"domain_scores_codex":[0.9926198,0.002082334,0.001259199,0.0006203367,0.002403183,0.001015121],"domain_scores_gemma":[0.9899639,0.007775846,0.00007248481,0.0008095101,0.001114302,0.0002639667],"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.001335303,0.0005402786,0.004057089,0.000007260607,0.00008748705,0.0001164142,0.004168569,0.4609464,0.009652186,0.004892787,0.009842463,0.5043538],"study_design_scores_gemma":[0.00127767,0.000354351,0.01463397,0.00005924493,0.000005238851,0.00003807062,0.003960793,0.9664142,0.003948123,0.001133232,0.007852233,0.000322889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7621028,0.001701599,0.193898,0.01070035,0.0001449813,0.002183891,0.00005385333,0.00004781758,0.0291667],"genre_scores_gemma":[0.9945761,0.00007450987,0.002599685,0.0004260463,0.0001768547,0.00004988908,0.00001128076,0.00002207342,0.002063566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5054678,"threshold_uncertainty_score":0.9990759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097369068","doi":"10.1061/(asce)co.1943-7862.0000483","title":"Heuristic Method for Satisfying Both Deadlines and Resource Constraints","year":2011,"lang":"en","type":"article","venue":"Journal of Construction Engineering and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristic; Scheduling (production processes); Software; Resource (disambiguation); Process (computing); Set (abstract data type); Operations research; Software engineering; Mathematical optimization; Operating system; Programming language; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0693014588953265,"gpt":0.3304401048909163,"spread":0.2611386459955898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002619348,0.0001419384,0.0003067707,0.0005641038,0.00009700065,0.0001330954,0.0001650739,0.00005084522,0.00002751906],"category_scores_gemma":[0.0007210954,0.0001145518,0.00008235755,0.0002061475,0.0001305342,0.0001821819,0.00006160056,0.0001378109,6.919651e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001782771,"about_ca_system_score_gemma":0.00001783626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002206576,"about_ca_topic_score_gemma":4.415845e-7,"domain_scores_codex":[0.9984367,0.00006110057,0.0007250685,0.0002161925,0.0003772921,0.0001835731],"domain_scores_gemma":[0.9985881,0.000587545,0.0004002773,0.0001414425,0.0001500535,0.0001325174],"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.0001231913,0.00002033078,0.003047166,0.0001698412,0.0002620815,0.00005628742,0.001231036,0.003307136,0.000518031,0.04427309,0.0003480704,0.9466438],"study_design_scores_gemma":[0.01856704,0.002208167,0.1046589,0.002538582,0.002124248,0.03136228,0.06035517,0.3912238,0.004541721,0.09921406,0.2798968,0.003309235],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05505713,0.0003118012,0.9422775,0.0001292657,0.000376243,0.0002024747,0.00000366152,0.00002367919,0.001618257],"genre_scores_gemma":[0.3728453,0.00008453873,0.6268604,0.0000400163,0.00009500773,0.000004706275,2.02757e-7,0.00001092813,0.00005893532],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9433345,"threshold_uncertainty_score":0.4671288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046023406","doi":"10.1016/j.advengsoft.2010.05.010","title":"A hybrid scatter search approach for resource-constrained project scheduling problem in PERT-type networks","year":2010,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":28,"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":"Metaheuristic; Job shop scheduling; Mathematical optimization; Computer science; Crossover; Scheduling (production processes); Critical path method; Local search (optimization); Benchmark (surveying); Algorithm; Mathematics; Artificial intelligence; Engineering; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.03298794965464718,"gpt":0.3305595728414295,"spread":0.2975716231867823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004719715,0.0004842234,0.0007043146,0.001330691,0.0001464306,0.0003222822,0.001371054,0.0002641987,0.00003939976],"category_scores_gemma":[0.006998823,0.0004320382,0.0001904966,0.002104587,0.0002205713,0.0008687263,0.0002315187,0.00158371,0.000009153653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000105188,"about_ca_system_score_gemma":0.0002336178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002253497,"about_ca_topic_score_gemma":0.00003180675,"domain_scores_codex":[0.9951837,0.0001293514,0.001218569,0.001284049,0.0009494355,0.001234918],"domain_scores_gemma":[0.9955403,0.002949935,0.0001943482,0.0008733162,0.0002759367,0.0001661538],"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.0001031477,0.00007204003,0.02203342,0.0001266647,0.00001140059,0.00002109758,0.0007937956,0.9067589,0.000498325,0.0002895836,0.00002595594,0.06926565],"study_design_scores_gemma":[0.001485762,0.0001215193,0.000712004,0.0002357394,0.000009425165,0.0001190789,0.0008999451,0.9852714,0.0004483989,0.0007685466,0.009157256,0.0007709333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.213995,0.001062825,0.7814372,0.0001115392,0.0004970863,0.001882334,0.00002303217,0.0003218248,0.0006691322],"genre_scores_gemma":[0.5038078,0.00002081723,0.4954807,0.0000593072,0.0002336576,0.0002349055,0.00002921118,0.00006661758,0.00006694726],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2898128,"threshold_uncertainty_score":0.9998131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886699219","doi":"10.1139/cjce-2017-0670","title":"Resource leveling in construction projects with activity splitting and resource constraints: a simulated annealing optimization","year":2018,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Resource leveling; Simulated annealing; Resource (disambiguation); Overtime; Computer science; Novelty; Operations research; Heuristic; Stakeholder; Industrial engineering; Project management; Engineering; Systems engineering; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.03741523378493097,"gpt":0.2731750177899749,"spread":0.2357597840050439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003474312,0.0002403202,0.0004446956,0.001753721,0.000226545,0.0004237517,0.0003387267,0.0001542994,0.0000874563],"category_scores_gemma":[0.005139128,0.0002119888,0.00006071747,0.001487252,0.0004211446,0.0005845283,0.00002963047,0.0005900897,0.000001366267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002224452,"about_ca_system_score_gemma":0.0008998006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003892494,"about_ca_topic_score_gemma":0.009292972,"domain_scores_codex":[0.997474,0.0001608449,0.0008559594,0.0003755787,0.0005871071,0.000546572],"domain_scores_gemma":[0.9973342,0.000813782,0.000555507,0.0002529754,0.0005168737,0.0005265934],"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.0000657139,0.000003901913,0.01033283,0.00001657433,0.00002824644,0.0001324114,0.002918618,0.9738726,0.0006250656,0.00007159001,0.00002059001,0.01191185],"study_design_scores_gemma":[0.001595662,0.0002595729,0.002915919,0.001124353,0.00003133362,0.001950191,0.006334747,0.9825407,0.001047269,0.00008203935,0.001659982,0.0004582175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8328887,0.0001459752,0.1643055,0.0002550769,0.0001385872,0.000204004,0.000006408016,0.000024704,0.002031095],"genre_scores_gemma":[0.979821,0.000002092245,0.01984202,0.0000467673,0.0002420473,0.000001016596,8.94818e-7,0.00003291728,0.00001124627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1469323,"threshold_uncertainty_score":0.8644651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061323651","doi":"10.1080/01446190410001673571","title":"Accelerating linear projects","year":2005,"lang":"en","type":"article","venue":"Construction Management and Economics","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Business; Engineering; Construction engineering; Process management; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1231112855323806,"gpt":0.3266476792046519,"spread":0.2035363936722713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044056,0.00013724,0.00019103,0.000340409,0.0002518963,0.0004741885,0.0002609833,0.00005817219,0.0002981086],"category_scores_gemma":[0.0001202956,0.0001262063,0.00005917828,0.000211556,0.0001485753,0.000605528,0.0001886107,0.0001083729,0.0002349517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004192564,"about_ca_system_score_gemma":0.00002018549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000258393,"about_ca_topic_score_gemma":0.00001092384,"domain_scores_codex":[0.9985526,0.00004204513,0.0005522566,0.0004761507,0.0001515214,0.0002254376],"domain_scores_gemma":[0.9991998,0.0001374361,0.0002220356,0.0003092318,0.00005013448,0.00008134949],"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.00001550584,0.000009264629,0.02316943,0.000007518207,0.00003453571,0.000001485425,0.0003354198,0.002578958,0.00001436165,0.04535921,0.0004453409,0.928029],"study_design_scores_gemma":[0.002564547,0.00008529531,0.01020313,0.00004056399,0.00007585933,0.0002218628,0.02118919,0.3875372,0.001048846,0.02634302,0.5496757,0.001014815],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9038743,0.00005544891,0.004668319,0.0008474637,0.0003414205,0.0002803045,0.000002898126,0.00006802506,0.08986179],"genre_scores_gemma":[0.8098863,0.0001565564,0.1865588,0.0003827983,0.000477331,0.000016646,0.000003410262,0.00001439354,0.002503722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9270142,"threshold_uncertainty_score":0.5146543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3129503847","doi":"10.1016/j.autcon.2021.103616","title":"Hybrid multi-mode simulation and optimization for subarea scheduling in heavy industrial construction","year":2021,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"PCL Construction (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bidding; Scheduling (production processes); Interdependence; Schedule; Computer science; Industrial engineering; Operations research; Engineering; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.127387408194525,"gpt":0.39216551898767,"spread":0.2647781107931451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002646758,0.0002268099,0.0004073994,0.001062541,0.0002213493,0.0004388861,0.0001472006,0.0002771181,0.0001104516],"category_scores_gemma":[0.01031963,0.0002476134,0.00008419408,0.001310579,0.0002089407,0.001245053,0.00005933974,0.0003021554,0.000006737624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002363115,"about_ca_system_score_gemma":0.0003468539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005957574,"about_ca_topic_score_gemma":0.00009707503,"domain_scores_codex":[0.9962145,0.00060142,0.001442299,0.0007887938,0.0006345913,0.0003183947],"domain_scores_gemma":[0.9962788,0.002138582,0.0005640077,0.0003262859,0.0006057708,0.00008661828],"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.000106518,0.00003069664,0.04060654,0.00001251727,0.000007057203,0.000003533249,0.0003446617,0.8345258,0.0004283425,0.001180551,0.000003900854,0.1227499],"study_design_scores_gemma":[0.00302659,0.00002821244,0.004086045,0.00009879929,0.00001303292,0.0001381112,0.00233652,0.982708,0.003142133,0.004102492,0.00008140103,0.000238703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5615421,0.00003373946,0.4368894,0.0002776139,0.0006185544,0.0004794988,0.00001980954,0.0000705467,0.00006869422],"genre_scores_gemma":[0.7094513,0.00001015414,0.2902335,0.00003361521,0.0001153552,0.0000516568,0.00007764531,0.00001587899,0.00001095454],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1481822,"threshold_uncertainty_score":0.9999976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1595750606","doi":"10.1061/(asce)cp.1943-5487.0000498","title":"Zero-One Programming Approach to Determine Optimum Resource Supply under Time-Dependent Resource Constraints","year":2015,"lang":"en","type":"article","venue":"Journal of Computing in Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Research Council Canada","keywords":"Schedule; Scheduling (production processes); Resource leveling; Duration (music); Computer science; Turnaround time; Operations research; Resource (disambiguation); Mathematical optimization; Project management; Resource allocation; Engineering; Systems engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07749233858812359,"gpt":0.3110297004792523,"spread":0.2335373618911287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01384788,0.0004222944,0.001006303,0.001709061,0.00009947316,0.0006153588,0.001631867,0.000204506,0.00003207307],"category_scores_gemma":[0.006062175,0.0003814299,0.0002551819,0.00169466,0.0001236372,0.0003380729,0.0004910181,0.001127721,0.00004452881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003630541,"about_ca_system_score_gemma":0.0002797617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005447013,"about_ca_topic_score_gemma":0.000002603973,"domain_scores_codex":[0.9930251,0.0003431754,0.002346589,0.0006145185,0.002759855,0.000910792],"domain_scores_gemma":[0.9951597,0.002064721,0.0008784479,0.0006025633,0.0005276409,0.0007669073],"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.00006876035,0.0001324678,0.001477175,0.0000207649,0.00004746985,0.00009221967,0.002686165,0.9682455,0.001349424,0.00006870592,0.0006678172,0.02514351],"study_design_scores_gemma":[0.004593865,0.0007502036,0.00271847,0.001692523,0.00007403121,0.003691635,0.006504907,0.9598683,0.001382421,0.0004711337,0.01692105,0.001331488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3684023,0.000238154,0.6217889,0.0004079578,0.0002764096,0.0004314398,0.000003470695,0.0001090398,0.008342312],"genre_scores_gemma":[0.8366541,8.551697e-7,0.1626757,0.0001264371,0.0003727077,0.000003051544,0.000001627865,0.00006033995,0.0001051645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4682518,"threshold_uncertainty_score":0.9998637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2757346420","doi":"10.1139/cjce-2017-0020","title":"Integration of linear scheduling method and the critical chain project management","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scheduling (production processes); Two-level scheduling; Industrial engineering; Dynamic priority scheduling; Distributed computing; Operations research; Mathematical optimization; Schedule; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0713092974417582,"gpt":0.3719281797955934,"spread":0.3006188823538352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007070982,0.0001226543,0.0003439105,0.0006368549,0.0002993967,0.0004225617,0.0008205997,0.00006025869,0.00003702235],"category_scores_gemma":[0.01521504,0.00007862068,0.0001308465,0.0001990124,0.0002509788,0.0003385905,0.00005280084,0.0003469189,0.000001370078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004399376,"about_ca_system_score_gemma":0.0002764178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000561684,"about_ca_topic_score_gemma":0.005931378,"domain_scores_codex":[0.9982888,0.000126691,0.0006854617,0.0001540985,0.0004958186,0.0002491939],"domain_scores_gemma":[0.9974738,0.001156239,0.0003808659,0.0004133998,0.0003379931,0.0002376373],"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.0003657162,0.00004173828,0.005614806,0.000401103,0.0007516695,0.0009948795,0.03072775,0.3335203,0.006769178,0.3372349,0.001035142,0.2825428],"study_design_scores_gemma":[0.002680026,0.0001502791,0.007267042,0.001122852,0.0001717219,0.0007777726,0.006056091,0.9567718,0.001858085,0.01308085,0.009624789,0.0004386775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04466831,0.000902892,0.9458241,0.002446025,0.0006463053,0.0002341807,0.000006435372,0.000006552501,0.005265125],"genre_scores_gemma":[0.9273415,0.00001600117,0.07237371,0.00003293012,0.0001642973,0.000002499166,1.254256e-7,0.00001141707,0.00005751342],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8826732,"threshold_uncertainty_score":0.9930802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026357126","doi":"10.1007/s10845-012-0719-5","title":"CIGI2011: A heuristic method for resource-constrained project scheduling with activity overlapping","year":2012,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; SNC-Lavalin (Canada)","funders":"","keywords":"Rework; Computer science; Schedule; Scheduling (production processes); Duration (music); Heuristic; Downstream (manufacturing); Upstream (networking); Set (abstract data type); Resource consumption; Resource (disambiguation); Operations research; Mathematical optimization; Industrial engineering; Operations management; Engineering; Mathematics; Artificial intelligence; Embedded system; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1218321197176,"gpt":0.4027743370761721,"spread":0.2809422173585721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01382827,0.0005231482,0.001107813,0.001456584,0.000384851,0.0005675982,0.001206179,0.0002137311,0.0001477981],"category_scores_gemma":[0.006166358,0.0003491725,0.0006846729,0.0005823812,0.0001778677,0.001235511,0.0001915176,0.001011147,0.00002571836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002816746,"about_ca_system_score_gemma":0.0004055135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002363363,"about_ca_topic_score_gemma":0.000005623607,"domain_scores_codex":[0.9936556,0.0006232545,0.001911967,0.000568206,0.002124314,0.001116696],"domain_scores_gemma":[0.9891163,0.006664117,0.002482828,0.000661077,0.0006061473,0.0004695217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00612723,0.0009702261,0.009344218,0.0003901837,0.001619009,0.0001830818,0.01805891,0.06545205,0.02907213,0.001466712,0.001215104,0.8661011],"study_design_scores_gemma":[0.004132569,0.001850251,0.004231809,0.001469688,0.0006806369,0.006040936,0.02556348,0.03052112,0.8274744,0.003969761,0.09188115,0.002184256],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4395775,0.000206959,0.5575522,0.0002506439,0.0003651166,0.0005298977,0.000008533045,0.00003446229,0.001474753],"genre_scores_gemma":[0.7364047,0.00001214458,0.2622858,0.0001297109,0.0008803246,0.00001634269,0.000001078066,0.00005289946,0.0002169298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8639169,"threshold_uncertainty_score":0.999896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074314438","doi":"10.1016/j.ejor.2008.10.030","title":"Activity list representation for a generalization of the resource-constrained project scheduling problem","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":19,"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":"Scheduling (production processes); Computer science; Generalization; Mathematical optimization; Representation (politics); Resource constraints; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.3762451047095662,"gpt":0.47259360421699,"spread":0.09634849950742386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02574607,0.0001528759,0.0003345748,0.0008101755,0.0009473198,0.0003209872,0.00134437,0.000048974,0.0000905361],"category_scores_gemma":[0.02453591,0.00009630304,0.0003179147,0.001937958,0.0006853345,0.0006259099,0.0002367263,0.0006256354,0.00001037343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009863247,"about_ca_system_score_gemma":0.001511243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001914201,"about_ca_topic_score_gemma":0.000005768103,"domain_scores_codex":[0.9888818,0.004928306,0.001474905,0.0003974326,0.003960268,0.0003572467],"domain_scores_gemma":[0.9907898,0.002947157,0.0009069214,0.0004923839,0.004744756,0.00011898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.003716312,0.0009445305,0.04225803,0.0001137717,0.0003730065,0.000206902,0.02313416,0.2028136,0.6100777,0.01543544,0.03030621,0.07062037],"study_design_scores_gemma":[0.02076188,0.006312776,0.1608182,0.00170074,0.0001693359,0.006323235,0.01926806,0.2823758,0.3626227,0.01150638,0.1261539,0.001986999],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9247312,0.00008516727,0.05867593,0.003313371,0.0001453302,0.001019835,0.00002828325,0.000009650082,0.01199125],"genre_scores_gemma":[0.9488988,0.00001735544,0.04902624,0.00006633135,0.0005437835,0.00001073434,0.00000520425,0.00002914384,0.001402388],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.247455,"threshold_uncertainty_score":0.9836808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021216055","doi":"10.5539/cis.v2n1p188","title":"Stochastic Programming Models and Hybrid Intelligent Algorithm for Unbalanced Bidding Problem","year":2009,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Division of Graduate Education; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Bidding; Computer science; Mathematical optimization; Stochastic programming; Genetic algorithm; Artificial neural network; Genetic programming; Value (mathematics); Order (exchange); Hybrid algorithm (constraint satisfaction); Stochastic optimization; Algorithm; Artificial intelligence; Machine learning; Mathematics; Constraint programming","retraction":null,"screen_n_in":null,"score":{"opus":0.06573409781362602,"gpt":0.3486509251111805,"spread":0.2829168272975545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002939696,0.0001265929,0.0001800931,0.0005539932,0.0004566961,0.001749502,0.0004630764,0.00002633913,0.000002183976],"category_scores_gemma":[0.0002715737,0.00009487057,0.00003391719,0.0008210797,0.0002907591,0.006634588,0.0001496159,0.0000862801,0.000006534627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002813929,"about_ca_system_score_gemma":0.0001010269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001442534,"about_ca_topic_score_gemma":8.767574e-8,"domain_scores_codex":[0.9979713,0.00001796543,0.0005868281,0.0003153325,0.0007785781,0.0003299751],"domain_scores_gemma":[0.998643,0.0002852121,0.0002207727,0.0002011473,0.0004820434,0.0001678509],"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.000003676952,0.000004835306,0.000008799352,0.000003505102,0.000001048524,1.275855e-7,0.001793926,0.01154344,0.00001886579,0.003509004,0.00002822683,0.9830846],"study_design_scores_gemma":[0.0002395347,0.0001457921,0.0002088112,0.00003078657,0.000002326696,0.00004405736,0.0003455234,0.9849972,0.0001836926,0.01234935,0.001323133,0.0001298035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02101822,0.00003762496,0.9774541,0.0002307981,0.0001327888,0.0005527164,0.000005477336,0.00005288755,0.0005153533],"genre_scores_gemma":[0.5973728,0.000006478941,0.4021488,0.0004065373,0.00004257212,0.00001209713,0.000002350976,0.000001778573,0.000006665713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9829547,"threshold_uncertainty_score":0.9992868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974202129","doi":"10.1016/j.autcon.2014.03.008","title":"Construction spatial modeling and scheduling with three-dimensional singularity functions","year":2014,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"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":"","keywords":"Scheduling (production processes); Cartesian coordinate system; Mathematical optimization; Computer science; Singularity; Dimension (graph theory); Fourth Dimension; Mathematics; Spacetime; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04101644279093249,"gpt":0.2994533535044828,"spread":0.2584369107135503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550114,0.0002480102,0.0003594622,0.0008414098,0.0004987916,0.0004049089,0.0001741403,0.0002089239,0.0001285495],"category_scores_gemma":[0.001816855,0.0002141428,0.00006376209,0.0009794245,0.0004634267,0.0009010687,0.00007620813,0.0003920568,0.00004270087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001007821,"about_ca_system_score_gemma":0.0001671311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000392984,"about_ca_topic_score_gemma":0.0007069649,"domain_scores_codex":[0.9965516,0.0003328053,0.0009559023,0.0007561912,0.001088741,0.0003147933],"domain_scores_gemma":[0.9978322,0.0007225731,0.0004283088,0.0004159018,0.0004785916,0.0001223921],"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.0001299043,0.00003521771,0.1934246,0.00001657023,0.00002851603,0.000002703102,0.0003210792,0.3261503,0.0009081983,0.01493291,0.000006324607,0.4640437],"study_design_scores_gemma":[0.0009809139,0.00006820956,0.0135455,0.00008140557,0.00002199942,0.0004611856,0.0008145018,0.9536452,0.0001510194,0.02991867,0.00006200546,0.000249429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5264812,0.00001294079,0.4719843,0.0002803214,0.0003716684,0.0001770801,0.000003215124,0.0001143104,0.0005749852],"genre_scores_gemma":[0.8158844,0.000001011097,0.1838561,0.00004505258,0.0001565417,0.00001889745,0.0000132864,0.00001558881,0.000009122599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6274949,"threshold_uncertainty_score":0.873249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3070075040","doi":"10.1108/ecam-10-2019-0590","title":"Optimized crew selection for scheduling of repetitive projects","year":2020,"lang":"en","type":"article","venue":"Engineering Construction & Architectural Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Crew; Duration (music); Operations research; Crew scheduling; Float (project management); Computer science; Operations management; Scheduling (production processes); Engineering; Aeronautics; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.06415923892039745,"gpt":0.3106000499711349,"spread":0.2464408110507375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009361425,0.0002620554,0.0004320782,0.0005469832,0.0001312274,0.0001376696,0.0004197835,0.00006842096,0.00008880627],"category_scores_gemma":[0.002062793,0.0002323043,0.0002507279,0.001224768,0.0001043928,0.0001872713,0.0001530457,0.0002444372,0.00001321338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005705633,"about_ca_system_score_gemma":0.00004040285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006714088,"about_ca_topic_score_gemma":5.134043e-7,"domain_scores_codex":[0.9972665,0.00008744148,0.0008542884,0.0006852844,0.0007425044,0.0003640077],"domain_scores_gemma":[0.9983958,0.000595284,0.0003479887,0.0002686172,0.0002456583,0.000146667],"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.0002974916,0.00001280551,0.0004615199,0.000213637,0.0001729547,0.000003212758,0.001238178,0.8781381,0.005843398,0.00821845,0.00003708924,0.1053631],"study_design_scores_gemma":[0.002444295,0.0003490564,0.001174241,0.0001721784,0.0001135846,0.0001070798,0.002924833,0.9667542,0.01999214,0.001430395,0.003962459,0.0005755187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2564586,0.00003580474,0.7398543,0.0008750855,0.0003584008,0.001052686,0.0000109301,0.0002268275,0.001127352],"genre_scores_gemma":[0.5448115,0.000003314961,0.4548527,0.00005408642,0.0001448068,0.00006603533,0.000004121671,0.00001980242,0.00004367896],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2883529,"threshold_uncertainty_score":0.9473095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2529544702","doi":"10.1007/s10479-016-2336-8","title":"An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Calgary","keywords":"Computer science; Schedule; Scheduling (production processes); Operations research; Mathematical optimization; Operating system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.4946935409284301,"gpt":0.5864833560107651,"spread":0.09178981508233497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03092602,0.0002030708,0.0004932801,0.001090609,0.0004858337,0.0003414833,0.002595371,0.0001780675,0.0001009468],"category_scores_gemma":[0.02092947,0.0001133579,0.0001662328,0.002044318,0.001316537,0.0006612713,0.0002599427,0.0004036242,0.00001120588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002763608,"about_ca_system_score_gemma":0.0004138039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001168424,"about_ca_topic_score_gemma":0.0007061215,"domain_scores_codex":[0.991067,0.003610305,0.001310652,0.0008560625,0.002427048,0.0007289121],"domain_scores_gemma":[0.9803718,0.01512,0.0002055685,0.001518253,0.002624304,0.0001600309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001039084,0.001347818,0.007016522,0.00008770683,0.0001287096,0.000008386475,0.03425513,0.1273807,0.6497539,0.06284706,0.001083992,0.115051],"study_design_scores_gemma":[0.00237375,0.001067913,0.005397981,0.0004238769,0.00001307583,0.00001300878,0.05238738,0.6422479,0.2784978,0.01216564,0.004976275,0.0004354007],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6839693,0.0001845668,0.3089229,0.003845401,0.0000135379,0.001870029,0.0002298676,0.00001848227,0.0009458712],"genre_scores_gemma":[0.8875474,0.00003188702,0.1116095,0.00008570228,0.00004702575,0.0004015507,0.00000683958,0.00001963652,0.0002505195],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5148671,"threshold_uncertainty_score":0.9978656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766525559","doi":"10.1080/01446193.2017.1390241","title":"A simulation-based method for effective workface planning of industrial construction projects","year":2017,"lang":"en","type":"article","venue":"Construction Management and Economics","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; PCL Construction (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Discrete event simulation; Work (physics); Plan (archaeology); Computer science; Workforce planning; Process (computing); Scale (ratio); Industrial engineering; Operations research; Workforce; Engineering; Simulation; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.1670221460818022,"gpt":0.4017609918205162,"spread":0.234738845738714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141494,0.0001796361,0.0003862024,0.0004487488,0.0006198677,0.0005588094,0.0003605344,0.0001442255,0.00002940579],"category_scores_gemma":[0.001961794,0.0001738458,0.0001252284,0.0001231201,0.000417705,0.0004833596,0.0001282534,0.000122056,0.000003719346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005369746,"about_ca_system_score_gemma":0.00005858997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000114792,"about_ca_topic_score_gemma":0.000003730332,"domain_scores_codex":[0.9982946,0.0001105195,0.0006556097,0.0005531956,0.0001714319,0.0002146725],"domain_scores_gemma":[0.9956376,0.002480828,0.001121448,0.0005320512,0.0001581035,0.00006994967],"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.0003098524,0.00001007401,0.1074555,0.0000264899,0.00009803105,6.471612e-7,0.0001881853,0.2330521,0.00001227082,0.01108422,0.00003061844,0.647732],"study_design_scores_gemma":[0.004199188,0.0001286725,0.005409925,0.0001090913,0.0001257722,0.000006651372,0.004397727,0.9531263,0.0009729824,0.02585521,0.005321375,0.0003471032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4944202,0.00001831288,0.4997674,0.0001785172,0.0009120843,0.001364932,0.00002387493,0.00002938816,0.00328529],"genre_scores_gemma":[0.7787375,0.000003734415,0.2209188,0.0000262233,0.0001605115,0.00006379573,0.000005397217,0.00001207127,0.00007195906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7200742,"threshold_uncertainty_score":0.7089224,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049149460","doi":"10.1007/s10845-006-0034-0","title":"Project-driven planning and scheduling support for virtual manufacturing","year":2006,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Scheduling (production processes); Critical path method; Schedule; Production planning; Dynamic priority scheduling; Two-level scheduling; Mathematical optimization; Industrial engineering; Distributed computing; Operations research; Engineering; Production (economics); Systems engineering; Operating system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08940917395364503,"gpt":0.372529907051988,"spread":0.283120733098343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004022371,0.0004100998,0.0007848135,0.001380712,0.0003592944,0.0008016053,0.0009492922,0.0001892715,0.0001164698],"category_scores_gemma":[0.001114616,0.000310403,0.0004536119,0.0001855641,0.0001486236,0.0008161394,0.0002385443,0.000663352,0.00002221857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001456525,"about_ca_system_score_gemma":0.0001949283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002420223,"about_ca_topic_score_gemma":0.000006662372,"domain_scores_codex":[0.9947571,0.0001452171,0.002317152,0.0005762588,0.001518,0.0006863095],"domain_scores_gemma":[0.9952737,0.002172524,0.001637296,0.0003777077,0.0003305284,0.0002082529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001782909,0.000380344,0.02304717,0.000242131,0.0005962256,0.0008155964,0.008650633,0.6210876,0.01940752,0.001697868,0.00452998,0.3177621],"study_design_scores_gemma":[0.001553511,0.0007974575,0.004792862,0.0004115757,0.000122472,0.001576163,0.008837874,0.009178732,0.9224618,0.006700768,0.04276059,0.0008061741],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8305545,0.0002570951,0.1665674,0.0002036215,0.0006894295,0.0004038084,0.00000970182,0.00003749179,0.001276939],"genre_scores_gemma":[0.9595403,0.00002260054,0.0386248,0.0001076035,0.0009837043,0.000008725598,0.000003685961,0.00004893847,0.000659654],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9030543,"threshold_uncertainty_score":0.9999348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388091559","doi":"10.1016/j.ijpe.2023.109077","title":"Integrated planning and scheduling of engineer-to-order projects using a Lamarckian Layered Genetic Algorithm","year":2023,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Schedule; Robustness (evolution); Scheduling (production processes); Genetic algorithm; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1207855348625341,"gpt":0.3748450309318462,"spread":0.2540594960693121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511634,0.0001464046,0.0003256357,0.001771345,0.0000605189,0.000216015,0.0005547044,0.00006964666,0.00003028662],"category_scores_gemma":[0.004202586,0.0001304552,0.00009452328,0.0007778449,0.00007555114,0.0004642298,0.0001320842,0.0002442754,0.00001296812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001265601,"about_ca_system_score_gemma":0.0003299369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001568348,"about_ca_topic_score_gemma":0.000002540977,"domain_scores_codex":[0.9976571,0.00009055369,0.001214387,0.0003293377,0.0005187068,0.0001898658],"domain_scores_gemma":[0.99703,0.0002804505,0.0008771343,0.0001845477,0.001514598,0.0001133266],"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.0001043748,0.00002972633,0.01120704,0.000006003518,0.0001820954,0.00002698857,0.002560389,0.859481,0.01162603,0.00006385682,0.00005223068,0.1146602],"study_design_scores_gemma":[0.001326248,0.0002405432,0.01679539,0.0003685238,0.00004593426,0.001929663,0.01125544,0.9362434,0.02486246,0.00414329,0.002344522,0.000444604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9150643,0.00008460382,0.08135584,0.001226015,0.002037266,0.00014779,0.00001570049,0.00001862683,0.00004981626],"genre_scores_gemma":[0.6417816,0.00003615567,0.3573556,0.00004647453,0.0006811933,0.000001980919,0.000002585889,0.00001856534,0.00007587212],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2759998,"threshold_uncertainty_score":0.5319808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100941354","doi":"10.5267/j.dsl.2015.5.005","title":"A study on the performance of differential search algorithm for single mode resource constrained project scheduling problem","year":2015,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Scheduling (production processes); Mode (computer interface); Resource (disambiguation); Algorithm; Differential evolution; Resource constraints; Operations research; Mathematics; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.2050226183755664,"gpt":0.4111129716131563,"spread":0.2060903532375899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.02022946,0.0003705526,0.0006032973,0.001466487,0.0008370869,0.001049489,0.00385008,0.00009064042,0.00001868958],"category_scores_gemma":[0.007737126,0.0002154153,0.000226243,0.004305232,0.002031207,0.0006969082,0.0006220998,0.0004718381,0.00004641984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000181831,"about_ca_system_score_gemma":0.0006930536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002478053,"about_ca_topic_score_gemma":0.000002703578,"domain_scores_codex":[0.9884028,0.000518963,0.001441792,0.001445599,0.0072325,0.0009583542],"domain_scores_gemma":[0.9905766,0.005934699,0.0005557083,0.00155175,0.001086749,0.0002945138],"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.00124744,0.001458078,0.01019257,0.00001369613,0.00007610302,0.00004160134,0.03797533,0.04937737,0.2455733,0.0007235681,0.002135452,0.6511855],"study_design_scores_gemma":[0.005171816,0.004000676,0.001654195,0.000268863,0.00004816868,0.0001150187,0.0676069,0.8496728,0.06844528,0.001007646,0.001099107,0.0009095458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8569726,0.000006354384,0.1380498,0.001526112,0.0002630689,0.002307612,0.00002729759,0.00005131813,0.0007958237],"genre_scores_gemma":[0.9146858,4.528687e-7,0.08441165,0.0005922952,0.0001316154,0.0001088637,0.000001771753,0.00002590497,0.00004158478],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8002954,"threshold_uncertainty_score":0.9999875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4242958581","doi":"10.1504/ijpom.2018.090372","title":"A path relinking-based scatter search for the resource-constrained project scheduling problem","year":2018,"lang":"en","type":"article","venue":"International Journal of Project Organisation and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Polytechnique Montréal; SNC-Lavalin (Canada)","funders":"","keywords":"Metaheuristic; Computer science; Critical path method; Benchmark (surveying); Mathematical optimization; Scheduling (production processes); Tabu search; Project management; Path (computing); Job shop scheduling; Schedule; Algorithm; Mathematics; Systems engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09024689563341826,"gpt":0.3932375767276911,"spread":0.3029906810942728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007722457,0.0002168373,0.0002665005,0.00110344,0.0003687614,0.0009690935,0.001304714,0.00008140366,0.0001392818],"category_scores_gemma":[0.0009820586,0.0001360364,0.0001961632,0.0005511142,0.0003498352,0.0003439265,0.0002394946,0.0002650721,0.00002212729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001431568,"about_ca_system_score_gemma":0.0004197564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000253974,"about_ca_topic_score_gemma":0.00001356371,"domain_scores_codex":[0.9956439,0.0002618581,0.00119918,0.0004266312,0.002160226,0.0003082465],"domain_scores_gemma":[0.9957169,0.001412542,0.0008264183,0.0003218019,0.001653655,0.00006873981],"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.004548497,0.0007902779,0.01367041,0.0003131393,0.002724088,0.0001774893,0.04086175,0.00434019,0.00673099,0.044083,0.03025917,0.851501],"study_design_scores_gemma":[0.01850914,0.003382183,0.006196648,0.001442345,0.0006595114,0.0009995184,0.07808401,0.1897425,0.01835255,0.0165796,0.6644565,0.001595527],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.132432,0.00018211,0.824351,0.02972426,0.001420981,0.003567068,0.00004063298,0.00008696218,0.008195058],"genre_scores_gemma":[0.8910307,0.00005479813,0.1052567,0.002067729,0.001090838,0.00004871608,0.000007785168,0.00003341932,0.0004093169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8499055,"threshold_uncertainty_score":0.9344991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072148912","doi":"10.3141/1761-16","title":"Critical Path Method–Line of Balance Model for Efficient Scheduling of Repetitive Construction Projects","year":2001,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Critical path method; Scheduling (production processes); Computer science; Schedule; Operations research; Pipeline transport; Path (computing); Industrial engineering; Engineering; Systems engineering; Operations management; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.2671081567740019,"gpt":0.5032961908038592,"spread":0.2361880340298573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02768991,0.0002796646,0.0009463613,0.00199756,0.0004992016,0.0001327918,0.001634773,0.000261216,0.0001729485],"category_scores_gemma":[0.01003592,0.0001993809,0.0007646197,0.004087068,0.001721965,0.000589448,0.00001581801,0.001718358,0.000003689252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001551961,"about_ca_system_score_gemma":0.001641116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000865457,"about_ca_topic_score_gemma":0.001303431,"domain_scores_codex":[0.9847366,0.002248026,0.003609971,0.0007185471,0.007752073,0.0009348152],"domain_scores_gemma":[0.9684706,0.0110931,0.001454565,0.0007500671,0.01786923,0.0003624323],"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.01355715,0.001179216,0.2378981,0.001009106,0.0003453807,0.0001086793,0.01665688,0.5723484,0.06202229,0.05156422,0.0006025366,0.04270807],"study_design_scores_gemma":[0.00583652,0.002673899,0.1639477,0.002090732,0.0002153041,0.0000136286,0.02847558,0.6930949,0.03869483,0.06348996,0.0008798258,0.0005870994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6166055,0.0001144869,0.3802355,0.001476296,0.0002421636,0.001034784,0.0001466963,0.00001069641,0.0001339167],"genre_scores_gemma":[0.8166552,0.0002334388,0.1827176,0.00001707308,0.0001155638,0.00006224349,0.000007362268,0.00003658899,0.0001549302],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2000497,"threshold_uncertainty_score":0.998303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3205823175","doi":"10.1016/j.autcon.2021.104002","title":"Streamlined project time-cost tradeoff optimization methodology: Algorithm, automation, and application","year":2021,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":15,"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":"","keywords":"Automation; Computer science; Industrial engineering; Engineering; Optimization algorithm; Algorithm; Mathematical optimization; Systems engineering; Mathematics; Mechanical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08429030014314813,"gpt":0.3876300114976504,"spread":0.3033397113545022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003827629,0.0002513281,0.0004442167,0.0009692283,0.0002659122,0.0004085408,0.0002514063,0.0003040257,0.0002925112],"category_scores_gemma":[0.004583125,0.0002485708,0.00008413351,0.002581621,0.0002511709,0.001034474,0.00008328479,0.0002550747,0.00007686086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001566538,"about_ca_system_score_gemma":0.0004033217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005547161,"about_ca_topic_score_gemma":0.00002427637,"domain_scores_codex":[0.9951808,0.00139614,0.001355748,0.0009062731,0.0008575267,0.0003034905],"domain_scores_gemma":[0.9961276,0.001862371,0.0006984007,0.0005522561,0.0006744406,0.00008495059],"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.00001963314,0.00005190531,0.005285975,0.0000157941,0.00002435957,0.000005228167,0.001154757,0.03942598,0.002809518,0.00220144,0.0001952778,0.9488102],"study_design_scores_gemma":[0.0009043195,0.0000267745,0.008054679,0.00003228917,0.00002550772,0.0003837153,0.0020227,0.9773377,0.003202249,0.006905567,0.0008463718,0.0002581697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07279684,0.00007440364,0.9229838,0.0011367,0.0003363418,0.0009249657,0.00003285509,0.0003426266,0.001371507],"genre_scores_gemma":[0.08810785,0.00003680069,0.9108935,0.000123741,0.0001493295,0.0002057922,0.000271479,0.00002824399,0.0001832932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.948552,"threshold_uncertainty_score":0.9999967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144411460","doi":"10.1139/l2012-053","title":"Generational differences on craft workers’ perceptions of the factors affecting labour productivity<sup>1</sup>This paper is one of a selection of papers in this Special Issue on Construction Engineering and Management.","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Craft; Productivity; Workforce; Baby boomers; Economic shortage; Labour economics; Engineering; Layoff; Business; Economics; Operations management; Economic growth; Unemployment; Government (linguistics); Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.0223260061047597,"gpt":0.2409645919002186,"spread":0.2186385857954589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001161008,0.0001771913,0.0003707866,0.001062726,0.00009366971,0.00004949884,0.0002322964,0.00009411255,0.002751821],"category_scores_gemma":[0.001181844,0.000140335,0.0001240077,0.0008766217,0.00009974471,0.0003142423,0.00002088755,0.0003763123,0.00000102121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001483342,"about_ca_system_score_gemma":0.0001482528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003405211,"about_ca_topic_score_gemma":0.002448597,"domain_scores_codex":[0.9980918,0.00009698006,0.0006727097,0.0001839371,0.0006689565,0.0002855825],"domain_scores_gemma":[0.9986882,0.0004304734,0.0003726324,0.0001678001,0.0001591843,0.0001816891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00003581421,0.00006091706,0.7000851,0.0001414309,0.0001826097,0.000002966474,0.01490626,0.2604946,0.01618335,0.0006660465,0.0002966433,0.006944272],"study_design_scores_gemma":[0.0005599166,0.0001836943,0.9722347,0.0009802555,0.0000679048,0.00007508387,0.006195488,0.008178987,0.008989338,0.00004744409,0.002182174,0.0003050765],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9972886,0.00006160143,0.0003082347,0.0001992292,0.0005050107,0.0001750295,0.00001622752,0.000004563836,0.001441504],"genre_scores_gemma":[0.9977215,0.00001359154,0.001425611,0.00001206292,0.0006962753,0.000002042024,4.362199e-7,0.00001514384,0.000113317],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2721495,"threshold_uncertainty_score":0.9981598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969628616","doi":"10.1111/itor.12071","title":"A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem","year":2014,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical optimization; Computer science; Ant colony optimization algorithms; Scheduling (production processes); Job shop scheduling; Multi-objective optimization; Set (abstract data type); Convergence (economics); Ant colony; Pareto principle; Local search (optimization); Pareto optimal; Mathematics; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.1385527995478368,"gpt":0.433266879528203,"spread":0.2947140799803662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01048448,0.0001636717,0.0001966883,0.001042422,0.000705052,0.0009434637,0.000867629,0.00007656536,0.0004536218],"category_scores_gemma":[0.002510608,0.0001193571,0.00005821627,0.00113117,0.0002482903,0.0003843596,0.00008776577,0.000677671,0.00007195759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003551162,"about_ca_system_score_gemma":0.0002920432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001232913,"about_ca_topic_score_gemma":0.00009333847,"domain_scores_codex":[0.9944371,0.0006964196,0.0006881608,0.0007608049,0.003052928,0.0003645587],"domain_scores_gemma":[0.9952703,0.003080767,0.00007762824,0.0003270825,0.001103487,0.0001407997],"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.0001134515,0.0001353921,0.0002449873,0.000002494985,0.00002625012,0.000001027757,0.001435358,0.9678515,0.0007106353,0.00931407,0.00006769952,0.02009719],"study_design_scores_gemma":[0.000662713,0.00006925842,0.0007970468,0.00002241424,0.000003374137,0.00003074146,0.002307665,0.9886553,0.0007798279,0.001985485,0.004536535,0.0001495874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01629192,0.0000153798,0.948652,0.008454829,0.0001724871,0.001149205,0.00003477155,0.00002305508,0.02520639],"genre_scores_gemma":[0.8124049,0.00001223518,0.1855998,0.000268357,0.0001662005,0.0006549976,0.000020011,0.00001525096,0.0008582752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7961129,"threshold_uncertainty_score":0.9097842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3156898704","doi":"10.1016/j.ifacol.2020.12.2858","title":"Collaborative supply chain planning and scheduling of construction projects","year":2020,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Supply chain; Scheduling (production processes); Integer programming; IBM; Production planning; Computer science; Linear programming; Supply chain management; Operations research; Project management; Process management; Manufacturing engineering; Operations management; Production (economics); Systems engineering; Business; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07845513194151653,"gpt":0.3529724922949883,"spread":0.2745173603534718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001325724,0.0002802043,0.0006130387,0.0002972275,0.0001976504,0.0001894374,0.0004170921,0.000161856,0.0001494651],"category_scores_gemma":[0.005843431,0.0002285306,0.00009759941,0.001764995,0.0004716075,0.0003788324,0.0001664585,0.0003601982,0.00002517094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002653506,"about_ca_system_score_gemma":0.0003032261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000166199,"about_ca_topic_score_gemma":0.000007197332,"domain_scores_codex":[0.9966915,0.0002710647,0.0008710939,0.0007672462,0.00103803,0.0003611099],"domain_scores_gemma":[0.9972991,0.001124146,0.0005494895,0.000291541,0.0004773315,0.0002584421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001563445,0.0001886823,0.3700206,0.0002584472,0.0003669533,0.0002143414,0.1317995,0.016045,0.2899093,0.00584868,0.00006375016,0.1837212],"study_design_scores_gemma":[0.008584764,0.00218674,0.02108926,0.0008552001,0.0002129798,0.0004142416,0.4317583,0.4353182,0.09095582,0.002562762,0.003818811,0.002242866],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9844232,0.000834943,0.006309315,0.005448471,0.0001716982,0.0005303439,0.0001270099,0.00009328035,0.002061796],"genre_scores_gemma":[0.6105606,0.00001599537,0.388784,0.0003678554,0.0001977874,0.000008119643,0.0000107368,0.00001722151,0.00003773015],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4192732,"threshold_uncertainty_score":0.9319209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4296579871","doi":"10.1139/cjce-2022-0029","title":"Enhanced repetitive scheduling formulation for meeting deadlines and resource constraints in linear and scattered projects","year":2022,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheduling (production processes); Computer science; Linear programming; Schedule; Crew; Critical path method; Operations research; Mathematical optimization; Distributed computing; Industrial engineering; Engineering; Systems engineering; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04169050765308387,"gpt":0.2898501007558356,"spread":0.2481595931027518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003933967,0.0001593891,0.0003510406,0.001252072,0.0002539271,0.0001618301,0.0002553227,0.00005753311,0.00004306943],"category_scores_gemma":[0.006455511,0.0001549812,0.00007217636,0.0005627277,0.00006490941,0.0002799199,0.00005058875,0.0003861886,2.571112e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001526264,"about_ca_system_score_gemma":0.0005323693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000144125,"about_ca_topic_score_gemma":0.007869714,"domain_scores_codex":[0.9980236,0.0000938994,0.0008130866,0.0002838144,0.0004042029,0.0003813503],"domain_scores_gemma":[0.9977167,0.001216685,0.0003758688,0.0001369431,0.0002313537,0.0003224102],"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.0001545609,0.00001648389,0.02241022,0.0001230746,0.00008138216,0.0001990699,0.01856446,0.912936,0.01695191,0.001499924,0.00009743027,0.02696553],"study_design_scores_gemma":[0.005005294,0.0006288245,0.0140007,0.001196467,0.00006985985,0.001933266,0.03276198,0.9282347,0.004682128,0.002058621,0.008360511,0.001067643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9532623,0.0006013674,0.04456247,0.0004571062,0.0002355836,0.0003457236,0.00002680142,0.00001025216,0.0004983678],"genre_scores_gemma":[0.9896773,0.000003597639,0.01004942,0.00007325398,0.0001338221,0.00001479115,0.000002509296,0.00002247492,0.00002288636],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03641492,"threshold_uncertainty_score":0.7728316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4284993186","doi":"10.1016/j.ijpe.2022.108557","title":"A model for advanced planning systems dedicated to the Engineer-To-Order context","year":2022,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Build to order; Production planning; Concurrent engineering; Context (archaeology); Industrial engineering; Order fulfillment; Integrated business planning; Operations research; Order (exchange); Production (economics); Operations management; Supply chain; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1231063701010345,"gpt":0.3784389776266892,"spread":0.2553326075256546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004203428,0.0001070639,0.000221132,0.0006387483,0.0001998233,0.0002490396,0.001333036,0.00002358717,0.00004194205],"category_scores_gemma":[0.004402264,0.00008287854,0.000120262,0.0002859948,0.00002284715,0.0003244282,0.0001657009,0.0002455044,0.00001798033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003260462,"about_ca_system_score_gemma":0.0002710921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004168125,"about_ca_topic_score_gemma":0.000004457209,"domain_scores_codex":[0.9978175,0.00008220983,0.001010856,0.0002894973,0.0006374231,0.0001625132],"domain_scores_gemma":[0.9971818,0.0004147126,0.0007405526,0.0002383191,0.001315844,0.0001088048],"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.0003188643,0.00002200845,0.0001600437,8.283322e-7,0.00007361476,0.000001495318,0.002415081,0.9759153,0.0005232551,0.0009343578,0.00318142,0.01645378],"study_design_scores_gemma":[0.0006724375,0.0001637776,0.00007942298,0.00002122295,0.00001350551,0.0004740463,0.008881389,0.8396714,0.0004669718,0.001680692,0.1477183,0.0001568107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.584412,0.0001198766,0.3792528,0.02825822,0.007298533,0.0004829624,0.00006310278,0.0000128263,0.00009970096],"genre_scores_gemma":[0.9776437,0.000004621754,0.0192867,0.0009784779,0.001042406,0.00007652872,0.000003708114,0.0000172359,0.0009466702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3932316,"threshold_uncertainty_score":0.5270239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994453397","doi":"10.1139/l08-135","title":"Robust global and local search approach to resource-constrained project scheduling","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Computer science; Local search (optimization); Guided Local Search; Scheduling (production processes); Genetic algorithm; Premature convergence; Tabu search; Heuristic; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06983607493615519,"gpt":0.296244105261282,"spread":0.2264080303251268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004104277,0.0003008911,0.0005629867,0.001430856,0.0001987398,0.00068133,0.0009661307,0.0001688061,0.00004855981],"category_scores_gemma":[0.00320349,0.0002643735,0.0001776306,0.001933948,0.0001537162,0.0003750413,0.00004387668,0.0006515844,0.000009739922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003479494,"about_ca_system_score_gemma":0.001769007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003915161,"about_ca_topic_score_gemma":0.002992033,"domain_scores_codex":[0.9964751,0.0001235786,0.001008675,0.000451538,0.001067415,0.0008736679],"domain_scores_gemma":[0.9970673,0.0003231022,0.0001884508,0.0003757263,0.0004143852,0.001631061],"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.00002968943,0.00001347866,0.001482706,0.000013561,0.00003662758,0.0001891932,0.001671078,0.9662351,0.0001686261,0.001912488,0.0009406628,0.02730681],"study_design_scores_gemma":[0.003112071,0.001209802,0.02214033,0.0009075581,0.0001137231,0.01090665,0.01978187,0.9030067,0.0003031804,0.001850032,0.03468736,0.001980725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2219945,0.001094327,0.7483436,0.001402435,0.0002653809,0.000395309,0.00002815758,0.00004270516,0.02643359],"genre_scores_gemma":[0.9519262,0.000002643161,0.04744025,0.0002610901,0.0003029242,0.000001727873,0.000001124095,0.00002033648,0.00004371523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7299317,"threshold_uncertainty_score":0.9999809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3093058335","doi":"10.1155/2020/8897710","title":"Effective Evolutionary Algorithm for Solving the Real-Resource-Constrained Scheduling Problem","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Evolutionary algorithm; Scheduling (production processes); Cuckoo search; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03489116857546906,"gpt":0.3284135591069907,"spread":0.2935223905315216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002724529,0.0002525805,0.0005317311,0.00024844,0.000380108,0.0001452282,0.0007038511,0.000113975,0.00003709499],"category_scores_gemma":[0.00185716,0.0001682146,0.000501994,0.0009227903,0.0001892806,0.0009065986,0.0000103206,0.0005201901,0.000006916675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007927365,"about_ca_system_score_gemma":0.0002638342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004029916,"about_ca_topic_score_gemma":0.00000591007,"domain_scores_codex":[0.9959692,0.0001804597,0.001685238,0.000422793,0.00137734,0.0003649658],"domain_scores_gemma":[0.9936203,0.003211307,0.001564188,0.000217046,0.001156749,0.0002303928],"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.0006856759,0.00006134638,0.001353842,0.00004177003,0.0001490442,0.00004030947,0.01521595,0.3820255,0.01693517,0.0009936577,0.0002276156,0.5822701],"study_design_scores_gemma":[0.02765854,0.007587948,0.1581336,0.001513461,0.001422632,0.0004712123,0.1705192,0.4453366,0.02436741,0.09820261,0.06193759,0.00284917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2693723,0.000432015,0.7226269,0.005512898,0.0003142579,0.001319602,0.00007106877,0.00005248337,0.0002985216],"genre_scores_gemma":[0.6424372,0.00002370574,0.3565561,0.0003176851,0.0005633586,0.00003837122,0.00001506031,0.00002861666,0.00001982512],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.579421,"threshold_uncertainty_score":0.6859593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012605577","doi":"10.1139/l09-049","title":"Improved genetic algorithm for resource-constrained scheduling of large projects","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"University of Florida","keywords":"Computer science; Scheduling (production processes); Schedule; Mathematical optimization; Genetic algorithm scheduling; Genetic algorithm; Project management; Algorithm; Dynamic priority scheduling; Two-level scheduling; Engineering; Systems engineering; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.02988674346614349,"gpt":0.28485290728277,"spread":0.2549661638166265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003454605,0.0002795936,0.0006830626,0.00166146,0.0001430682,0.0002120865,0.0009804859,0.000178034,0.0001132096],"category_scores_gemma":[0.005599463,0.0002511185,0.0004031614,0.0009764342,0.00007966742,0.0002836219,0.00001904936,0.000433747,0.000002233461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001366639,"about_ca_system_score_gemma":0.001699884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007280766,"about_ca_topic_score_gemma":0.002012736,"domain_scores_codex":[0.9965833,0.00006756607,0.001537659,0.000327245,0.0006615472,0.0008227243],"domain_scores_gemma":[0.9965155,0.0007306943,0.0007264794,0.0004157118,0.000781659,0.0008300309],"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.0001341045,0.000135901,0.002187825,0.0001648528,0.0004718089,0.0005320279,0.009833056,0.3347124,0.05217334,0.002512577,0.002228438,0.5949137],"study_design_scores_gemma":[0.003402486,0.001036916,0.002902518,0.0005506028,0.0001116396,0.0009331867,0.002873116,0.9579931,0.006769473,0.001782601,0.02085146,0.0007928839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1131251,0.001485094,0.8822906,0.0005063302,0.000580564,0.0005547724,0.00009288456,0.00002893912,0.001335738],"genre_scores_gemma":[0.8624583,0.000003593192,0.1369414,0.0001146096,0.0003904987,0.000003797663,0.000001810198,0.00003055203,0.00005539542],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7493333,"threshold_uncertainty_score":0.9999941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994525790","doi":"10.1111/j.1475-3995.2012.00842.x","title":"Resource‐constrained project scheduling through the goal programming model: integration of the manager's preferences","year":2012,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University; Université Laval; Golder Associates (Canada)","funders":"","keywords":"Goal programming; Computer science; Scheduling (production processes); Operations research; Process management; Mathematical optimization; Business; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.3098998449138487,"gpt":0.4917509864743744,"spread":0.1818511415605257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01023501,0.00020483,0.000230013,0.000713256,0.0007808781,0.0005792686,0.002133244,0.0001526192,0.0004783926],"category_scores_gemma":[0.004240457,0.0001160608,0.0002240495,0.00227884,0.0009574548,0.001376106,0.0001274447,0.001243546,0.00002986922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002466856,"about_ca_system_score_gemma":0.0007380742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000370574,"about_ca_topic_score_gemma":0.0003723165,"domain_scores_codex":[0.9921712,0.001223884,0.001141403,0.0004916323,0.004411175,0.0005606537],"domain_scores_gemma":[0.9945625,0.003295842,0.0002150255,0.0005973525,0.00126381,0.00006547732],"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.0003599517,0.000856674,0.00879241,0.00002186216,0.0002124714,0.000002685082,0.03180437,0.6225352,0.006567972,0.1614613,0.0003910367,0.1669941],"study_design_scores_gemma":[0.001408292,0.0001277549,0.007263335,0.0003701258,0.00003529364,0.00010906,0.05962867,0.8542827,0.01071541,0.03296139,0.03255708,0.0005408303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3374418,0.0002715804,0.5695383,0.01912067,0.001125148,0.002944537,0.000148665,0.00006854735,0.06934077],"genre_scores_gemma":[0.9628687,0.00001994978,0.03427247,0.0001197412,0.0002341923,0.0003414125,0.00001512844,0.00001860177,0.002109816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6254269,"threshold_uncertainty_score":0.6005962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4360591935","doi":"10.5267/j.dsl.2023.2.002","title":"A convolutional neural network for the resource-constrained project scheduling problem (RCPSP): A new approach","year":2023,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Schedule; Project management; Scheduling (production processes); Project planning; Artificial neural network; Operations research; Mathematical optimization; Artificial intelligence; Systems engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1474752084462414,"gpt":0.3875546990255678,"spread":0.2400794905793263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03030454,0.0005155858,0.0006518282,0.001689849,0.002921271,0.002665588,0.005662648,0.0001743307,0.00009737643],"category_scores_gemma":[0.01762625,0.0003210748,0.0005610511,0.01528772,0.002647236,0.001109998,0.0009470578,0.0006901235,0.0004533162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001749805,"about_ca_system_score_gemma":0.001369969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005320738,"about_ca_topic_score_gemma":0.000009622395,"domain_scores_codex":[0.9873416,0.0003558905,0.001740467,0.002359797,0.006141809,0.002060427],"domain_scores_gemma":[0.9800818,0.01635009,0.0006954481,0.001857157,0.0005413775,0.0004741369],"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.0004050662,0.00004183312,0.002773215,0.00000841797,0.00004474636,0.0000231711,0.002808004,0.5627741,0.006195831,0.005686085,0.193422,0.2258176],"study_design_scores_gemma":[0.001700561,0.00008881067,0.003665615,0.0000708872,0.00003692864,0.0001906338,0.004258273,0.8895346,0.0001056085,0.01236697,0.08731639,0.0006647108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2760144,0.0001571017,0.6874399,0.02788005,0.001375173,0.003821915,0.00005597741,0.0005495778,0.002705886],"genre_scores_gemma":[0.4014198,0.00001248282,0.5836289,0.01054499,0.002251758,0.0004981202,0.00003406838,0.00009515649,0.001514749],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3267606,"threshold_uncertainty_score":0.9999241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}