{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":62,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":62,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"65952cc4235e","filters":{"venue":"Journal of Scheduling"}},"results":[{"id":"W2014856631","doi":"10.1007/s10951-008-0077-5","title":"A survey of search methodologies and automated system development for examination timetabling","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":378,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick; Queen's University","funders":"","keywords":"Generality; Presentation (obstetrics); Computer science; Benchmark (surveying); Data science; Confusion; Management science; Operations research; Psychology; Engineering","authors":[{"name":"Rong Qu","is_ca":false},{"name":"Edmund Burke","is_ca":false},{"name":"B. McCollum","is_ca":true},{"name":"Liam T. G. Merlot","is_ca":false},{"name":"S. Y. Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4968872769107157,"gpt":0.4637269991699302,"spread":0.0331602777407855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004520689,0.001112254,0.001375582,0.005433606,0.0006563845,0.002598951,0.002446686,0.00114959,0.003515444],"category_scores_gemma":[0.01241647,0.001032707,0.001522487,0.008532959,0.0006199335,0.002634384,0.0007617424,0.001078323,0.001086312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001270819,"about_ca_system_score_gemma":0.002649319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004073266,"about_ca_topic_score_gemma":0.005476721,"domain_scores_codex":[0.9958783,0.001328282,0.0005064539,0.0005545205,0.001573079,0.0001593034],"domain_scores_gemma":[0.9910261,0.006330024,0.0004895768,0.0007144323,0.001347998,0.00009190191],"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.00007179347,0.000236962,0.002197804,0.003880077,0.0001326443,0.00005577663,0.0001668016,0.02414601,0.003580521,0.02289763,0.004581989,0.9380519],"study_design_scores_gemma":[0.0002372118,0.0009150036,0.008135487,0.004233545,0.0005287926,0.001731644,0.0007799104,0.586015,0.02135005,0.1084231,0.2674381,0.0002122874],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.0140465,0.09095541,0.88054,0.001053446,0.0001175392,0.0003341153,0.0005064251,0.001307268,0.01113932],"genre_scores_gemma":[0.05021497,0.05491693,0.8904464,0.0003629585,0.0001242241,0.0003141764,0.0008042947,0.0002593857,0.002556642],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.005433606,"threshold_uncertainty_score":0.02390796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071552003","doi":"10.1007/s10951-007-0029-5","title":"A tabu search heuristic for the quay crane scheduling problem","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":189,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Computer science; Greedy randomized adaptive search procedure; GRASP; Vehicle routing problem; Greedy algorithm; Mathematics; Routing (electronic design automation)","authors":[{"name":"Marcello Sammarra","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Maria Flavia Monaco","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02566375608135085,"gpt":0.2728185617587647,"spread":0.2471548056774139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100696,0.0006877899,0.001320337,0.001314592,0.001161112,0.00126443,0.001679827,0.00190707,0.01074436],"category_scores_gemma":[0.003178156,0.0007443722,0.000671155,0.001969849,0.0008410484,0.001179946,0.0008296789,0.0009479302,0.0009182824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001676206,"about_ca_system_score_gemma":0.002248269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01832418,"about_ca_topic_score_gemma":0.01694811,"domain_scores_codex":[0.9994757,0.0002706225,0.00001658188,0.00005590686,0.00008528625,0.00009599714],"domain_scores_gemma":[0.9986727,0.0009370818,0.0000634508,0.00007357838,0.0001774849,0.0000756713],"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.0003101827,0.0001890818,0.0003965357,0.0001548393,0.00005106731,0.000075643,0.00007681676,0.8790213,0.00110959,0.006956012,0.007826689,0.1038323],"study_design_scores_gemma":[0.0000929138,0.00007665918,0.000146527,0.00001690628,0.00001779052,0.00001650595,0.00002956388,0.9950664,0.0002932376,0.002660571,0.001571944,0.00001088181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2451339,0.004787815,0.7002459,0.001729154,0.0008940198,0.0007012552,0.001164147,0.003961577,0.04138211],"genre_scores_gemma":[0.5193789,0.0007697436,0.4686919,0.000395862,0.0001253376,0.0003970962,0.0007661408,0.0004176668,0.009057328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01832418,"threshold_uncertainty_score":0.03643501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985603248","doi":"10.1007/s10951-008-0066-8","title":"Graph colouring approaches for a satellite range scheduling problem","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Satellite Communication Systems","field":"Engineering","cited_by":178,"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":"Heuristics; Computer science; Tabu search; Mathematical optimization; Scheduling (production processes); Permutation (music); Graph; Schedule; Theoretical computer science; Algorithm; Mathematics","authors":[{"name":"Nicolas Zufferey","is_ca":false},{"name":"Patrick Amstutz","is_ca":false},{"name":"Philippe Giaccari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0902862258790321,"gpt":0.2521157075287561,"spread":0.161829481649724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001824661,0.001681371,0.001533122,0.001942526,0.001333889,0.002433266,0.003149672,0.001997149,0.006103795],"category_scores_gemma":[0.005048052,0.001049376,0.001887185,0.003111593,0.001996118,0.004114667,0.002480871,0.003101845,0.0005717779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00271387,"about_ca_system_score_gemma":0.00168735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01034225,"about_ca_topic_score_gemma":0.01002911,"domain_scores_codex":[0.9986416,0.0006119048,0.00004658956,0.0002339617,0.0002953376,0.0001707099],"domain_scores_gemma":[0.9964367,0.002584377,0.0002182276,0.0002550191,0.0002837855,0.0002219322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001489415,0.0001914494,0.0003766067,0.0003410349,0.00008926597,0.00009588374,0.0003043795,0.7395627,0.002021944,0.1918496,0.004363519,0.06065471],"study_design_scores_gemma":[0.00005038928,0.00005444313,0.0001565966,0.0000376231,0.00004915141,0.0000352038,0.00008119464,0.7727547,0.0004852681,0.2220848,0.004191787,0.0000189181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01523134,0.000883877,0.9714395,0.000685294,0.0001577081,0.0001859862,0.0001406511,0.0001741676,0.01110139],"genre_scores_gemma":[0.2646139,0.002625074,0.7144743,0.0005848313,0.0004167185,0.0003752133,0.000515928,0.0004322951,0.01596178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01034225,"threshold_uncertainty_score":0.02056408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094070748","doi":"10.1007/s10951-010-0188-7","title":"Scheduling technicians and tasks in a telecommunications company","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Orange","keywords":"Computer science; Scheduling (production processes); Operations research; Technician; Heuristic; Task (project management); Job shop scheduling; Telecommunications; Industrial engineering; Operations management; Artificial intelligence; Computer network; Systems engineering; Engineering","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Fédérico Pasin","is_ca":true},{"name":"Stefan Røpke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08476310417682809,"gpt":0.3892352386411909,"spread":0.3044721344643628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001933021,0.0005615427,0.0006021168,0.0008638481,0.002379549,0.002100539,0.001055393,0.002094338,0.005356953],"category_scores_gemma":[0.003517866,0.0007844084,0.0006136786,0.001254427,0.0006608007,0.0009527653,0.0006901083,0.0009176794,0.0004125969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002354709,"about_ca_system_score_gemma":0.00364647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02464773,"about_ca_topic_score_gemma":0.01644026,"domain_scores_codex":[0.9989781,0.0004079409,0.00006180498,0.0001397527,0.0001295978,0.0002827813],"domain_scores_gemma":[0.9974082,0.001593941,0.000222277,0.00008724839,0.0001591923,0.000529141],"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.002055854,0.001082318,0.009964683,0.0001263119,0.0001056159,0.001199668,0.0005296002,0.9138067,0.01057552,0.008878826,0.002611018,0.04906387],"study_design_scores_gemma":[0.0001888511,0.0005840186,0.004601686,0.00001485408,0.00006572835,0.0001415726,0.0007527896,0.9828904,0.002975887,0.00528875,0.002461809,0.00003363216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9220141,0.0002847005,0.06817097,0.0007139528,0.00008433051,0.0003888675,0.0001666698,0.000162472,0.008013981],"genre_scores_gemma":[0.9726002,0.0001410149,0.022782,0.00005889988,0.00004416154,0.00009105087,0.0001365362,0.0000286589,0.004117313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02464773,"threshold_uncertainty_score":0.04900855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068123526","doi":"10.1007/s10951-008-0072-x","title":"A comparison of five heuristics for the multiple depot vehicle scheduling problem","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Giro (Canada)","funders":"","keywords":"Heuristics; Column generation; Mathematical optimization; Tabu search; Scheduling (production processes); Computer science; Heuristic; Set (abstract data type); Job shop scheduling; Mathematics; Schedule","authors":[{"name":"Ann-Sophie Pepin","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"Dennis Huisman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05247880305225816,"gpt":0.3194970015072238,"spread":0.2670181984549656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003690492,0.001179339,0.001622877,0.002774677,0.0009769668,0.001549128,0.002450953,0.001895477,0.002854476],"category_scores_gemma":[0.00793305,0.0005710922,0.001385586,0.002971064,0.0004915705,0.001634855,0.000794278,0.001161647,0.0003040449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002795751,"about_ca_system_score_gemma":0.002988789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009345695,"about_ca_topic_score_gemma":0.01374652,"domain_scores_codex":[0.997548,0.001192553,0.0001659463,0.0002296456,0.0004630116,0.0004008426],"domain_scores_gemma":[0.9898294,0.007854287,0.0005250547,0.0005602018,0.0008308769,0.0004001345],"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.003318778,0.001690072,0.004238342,0.001339398,0.0007178038,0.00008743948,0.0001654042,0.6872755,0.002566581,0.008456179,0.004776322,0.2853682],"study_design_scores_gemma":[0.0009524008,0.002761728,0.0051743,0.0001457055,0.0005387755,0.0001255331,0.0004053231,0.9743893,0.003142497,0.007508919,0.004783411,0.00007203912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6485451,0.01961107,0.2874965,0.00125118,0.001215786,0.001200169,0.001635545,0.002856203,0.03618838],"genre_scores_gemma":[0.7520642,0.003612192,0.2397261,0.0003477711,0.0001247252,0.0002909463,0.00119993,0.0002939765,0.002340154],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009345695,"threshold_uncertainty_score":0.02028471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025473159","doi":"10.1007/s10951-008-0080-x","title":"A theoretic and practical framework for scheduling in a stochastic environment","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Operations research; Industrial engineering; Mathematical optimization","authors":[{"name":"Julien Bidot","is_ca":false},{"name":"Thierry Vidal","is_ca":false},{"name":"Philippe Laborie","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0288714523609218,"gpt":0.2837969058946502,"spread":0.2549254535337284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006873243,0.001846658,0.001858324,0.002044562,0.002440368,0.005298066,0.004476142,0.002794301,0.007247581],"category_scores_gemma":[0.01873807,0.001562683,0.001959689,0.003389207,0.005336466,0.007011371,0.004542706,0.00638915,0.001233782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004201659,"about_ca_system_score_gemma":0.006145223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006934546,"about_ca_topic_score_gemma":0.007183987,"domain_scores_codex":[0.9936721,0.002646014,0.0003481379,0.0007474847,0.002085652,0.0005005565],"domain_scores_gemma":[0.9917767,0.00479978,0.0005402065,0.001359058,0.001031538,0.000492735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002325589,0.00004959794,0.0001251327,0.00007066453,0.00001926757,0.00007243791,0.0001041819,0.1929312,0.0004396228,0.7935154,0.002392587,0.01025677],"study_design_scores_gemma":[0.00001701512,0.00002830392,0.00004142836,0.00001848655,0.00001095558,0.00005623118,0.00004727744,0.5470083,0.0001942458,0.4472593,0.005300099,0.00001828172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001018633,0.0001005892,0.995184,0.0006908195,0.00005681412,0.00004756623,0.00006255994,0.0001193403,0.002719638],"genre_scores_gemma":[0.1955294,0.0008826965,0.7960644,0.0004186764,0.0007583739,0.0005176645,0.0002958835,0.0002307333,0.00530212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007247581,"threshold_uncertainty_score":0.03634965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034555835","doi":"10.1007/s10951-009-0114-z","title":"Implicit shift scheduling with multiple breaks and work stretch duration restrictions","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Duration (music); Work (physics); Scheduling (production processes); Computer science; Constraint (computer-aided design); Mathematical optimization; Flexibility (engineering); Context (archaeology); Mathematics; Statistics; Engineering","authors":[{"name":"Monia Rekik","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"François Soumis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0559839752264544,"gpt":0.3383749230511079,"spread":0.2823909478246535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002684882,0.0008891073,0.001912393,0.0007130906,0.001049954,0.00179541,0.003915043,0.00126799,0.00631595],"category_scores_gemma":[0.007116717,0.001115565,0.001029029,0.001543499,0.001062289,0.003232042,0.002422772,0.00229464,0.0005734056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000835567,"about_ca_system_score_gemma":0.002349288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002583482,"about_ca_topic_score_gemma":0.003030993,"domain_scores_codex":[0.9982185,0.0005804183,0.00009762018,0.0002803302,0.0003996084,0.0004235444],"domain_scores_gemma":[0.9952773,0.002374447,0.0006160272,0.0009039771,0.0003795067,0.0004487034],"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.002270733,0.0006603844,0.001306211,0.0003834841,0.00009277112,0.0001485411,0.0004240239,0.8061143,0.008945377,0.07527008,0.002176702,0.1022075],"study_design_scores_gemma":[0.0001659212,0.0004532932,0.0005959793,0.00002270539,0.00004342577,0.00004330889,0.00007421218,0.959169,0.001660059,0.03569779,0.002041851,0.00003249023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.170405,0.0002999366,0.8205124,0.000325737,0.0001588429,0.000268439,0.0002451265,0.0002984082,0.007486155],"genre_scores_gemma":[0.8657611,0.0001957041,0.1244398,0.00005163122,0.0001303235,0.0002770139,0.000173967,0.00009995991,0.008870411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00631595,"threshold_uncertainty_score":0.02112895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1485398007","doi":"10.1023/a:1024008726557","title":"Complexity of One-Cycle Robotic Flow-Shops","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Equidistant; Computer science; Mathematical optimization; Hoist (device); Scheduling (production processes); Flow shop scheduling; Mathematics; Job shop scheduling; Engineering; Schedule","authors":[{"name":"Nadia Brauner","is_ca":false},{"name":"Gerd Finke","is_ca":false},{"name":"Wiesław Kubiak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03700141970528022,"gpt":0.2429198977066208,"spread":0.2059184780013406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001149732,0.0007263744,0.002088531,0.0009921376,0.0009856226,0.002828803,0.001962645,0.001473718,0.005518944],"category_scores_gemma":[0.007393091,0.0008064643,0.001300863,0.001148641,0.001511218,0.003264703,0.001456121,0.001329731,0.0002217855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001596188,"about_ca_system_score_gemma":0.001618548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003570377,"about_ca_topic_score_gemma":0.002720324,"domain_scores_codex":[0.9988949,0.0003004773,0.0000554257,0.000212338,0.0003309016,0.0002060999],"domain_scores_gemma":[0.9917403,0.006430253,0.0008183129,0.0002130149,0.0002796976,0.0005183221],"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.0003480564,0.0001594827,0.002212883,0.000252274,0.00007682843,0.0004065918,0.0002452286,0.830773,0.001852808,0.1485972,0.001706904,0.0133688],"study_design_scores_gemma":[0.0000557948,0.00005879105,0.0007324928,0.000009755246,0.00001977135,0.00008318159,0.00007064137,0.841761,0.0003378492,0.15642,0.0004315168,0.00001914127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7388477,0.0008052099,0.2428733,0.001529485,0.00007563976,0.0001336021,0.001006281,0.0002050242,0.01452383],"genre_scores_gemma":[0.9767223,0.0003705005,0.01808888,0.00006854845,0.00008400028,0.00008443335,0.000485938,0.00005740369,0.004038042],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005518944,"threshold_uncertainty_score":0.01846272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1558369927","doi":"10.1023/a:1024042209719","title":"Scheduling and Lot Streaming in Flowshops with No-Wait in Process","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; McMaster University; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Dallas","keywords":"Travelling salesman problem; Job shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Schedule; Heuristic; Product (mathematics); Heuristics; Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Nicholas G. Hall","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Esaignani Selvarajah","is_ca":true},{"name":"Chelliah Sriskandarajah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00810058617292611,"gpt":0.2226019535302111,"spread":0.2145013673572849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004207731,0.0007679537,0.00181981,0.0008968948,0.001168546,0.001504121,0.002296986,0.001108715,0.002847872],"category_scores_gemma":[0.007446652,0.001113534,0.001016726,0.001219964,0.001299094,0.002261016,0.001215489,0.001126031,0.0001804713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00140836,"about_ca_system_score_gemma":0.001221817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0043057,"about_ca_topic_score_gemma":0.003596848,"domain_scores_codex":[0.9989564,0.0004378827,0.00006497854,0.0001570223,0.0002071137,0.0001764794],"domain_scores_gemma":[0.9940911,0.004233079,0.0004714979,0.000306933,0.0004413295,0.000456035],"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.0009887816,0.0001832033,0.001027909,0.0001491606,0.00009619498,0.00022002,0.0001692945,0.9358478,0.003355995,0.04203631,0.001165045,0.01476026],"study_design_scores_gemma":[0.00003208057,0.00007334336,0.0001155354,0.000004293713,0.00001487606,0.00001808721,0.00001695154,0.9891528,0.0003666385,0.01002683,0.0001707094,0.000007821763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2140918,0.0005745465,0.780215,0.000524974,0.0001696261,0.0002378562,0.0001775208,0.0003828543,0.003625847],"genre_scores_gemma":[0.9156193,0.0003101738,0.07917368,0.00011988,0.0001086147,0.0001451238,0.0001809152,0.00008962522,0.004252724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0043057,"threshold_uncertainty_score":0.02225286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986115514","doi":"10.1007/s10951-006-0003-7","title":"Time slot scheduling of compatible jobs","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Centre de Recherches Mathématiques","keywords":"Bipartite graph; Scheduling (production processes); Combinatorics; Time complexity; Computer science; Graph coloring; Heuristic; Graph; Discrete mathematics; Mathematics; Mathematical optimization","authors":[{"name":"Marc Demange","is_ca":false},{"name":"D. de Werra","is_ca":false},{"name":"Jérôme Monnot","is_ca":false},{"name":"Vangélis Th. Paschos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01296892274091942,"gpt":0.2408808956938547,"spread":0.2279119729529352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002341765,0.0006751778,0.001271405,0.0008152017,0.001355662,0.001719395,0.001551946,0.0006594983,0.00348905],"category_scores_gemma":[0.005984138,0.0007960367,0.0006154751,0.001453327,0.0008988437,0.00154329,0.001177387,0.0008846417,0.0004482872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006629192,"about_ca_system_score_gemma":0.001256779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001331304,"about_ca_topic_score_gemma":0.001196433,"domain_scores_codex":[0.9989912,0.000309304,0.00005923157,0.0001488691,0.0002333365,0.0002581933],"domain_scores_gemma":[0.9967649,0.001664526,0.0002678258,0.0003477478,0.0004364148,0.0005185199],"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.01136103,0.001143633,0.005670944,0.0005797324,0.0002237987,0.001927165,0.001195593,0.4569474,0.05396869,0.3285378,0.01051967,0.1279246],"study_design_scores_gemma":[0.0003494034,0.0007795232,0.0009468585,0.00002292797,0.00006179512,0.0002277135,0.0001685025,0.8958955,0.007801651,0.08954185,0.004159085,0.00004517174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4715106,0.0005505714,0.5151974,0.0003044551,0.0005629198,0.000297662,0.0002424649,0.0004896246,0.01084435],"genre_scores_gemma":[0.8921368,0.0001683116,0.1035954,0.00005665187,0.000120511,0.000118481,0.0002119804,0.0001324558,0.003459364],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00348905,"threshold_uncertainty_score":0.01238459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053052668","doi":"10.1007/s10951-007-0015-y","title":"Optimal due date assignment in multi-machine scheduling environments","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Tardiness; Mathematical optimization; Computer science; Scheduling (production processes); Due date; Single-machine scheduling; Assignment problem; Time complexity; Job shop scheduling; Generalized assignment problem; Weapon target assignment problem; Function (biology); Mathematics; Algorithm; Schedule","authors":[{"name":"Dvir Shabtay","is_ca":true},{"name":"George Steiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01833816959217388,"gpt":0.2556672366537828,"spread":0.2373290670616089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004406516,0.001058435,0.002854781,0.001894336,0.001897103,0.003214438,0.002444596,0.001430784,0.004241247],"category_scores_gemma":[0.01170062,0.001408784,0.0006889018,0.003009013,0.001018551,0.003840157,0.002066494,0.001614962,0.0005398716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001826414,"about_ca_system_score_gemma":0.002354865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00207786,"about_ca_topic_score_gemma":0.002640768,"domain_scores_codex":[0.9974935,0.001113858,0.000136158,0.0003620746,0.000436628,0.0004578079],"domain_scores_gemma":[0.9950525,0.002930792,0.0004744355,0.0005189924,0.0005238206,0.0004994434],"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.0009165653,0.0002769835,0.000668858,0.0002245082,0.00006530546,0.0001353479,0.0001398693,0.8803926,0.002257451,0.05216678,0.004122194,0.05863356],"study_design_scores_gemma":[0.00008937249,0.00009976728,0.0002633097,0.0000137261,0.00001960364,0.00004416642,0.00003828154,0.956604,0.0009465114,0.04060598,0.001254191,0.00002104127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0769987,0.00152435,0.9131518,0.0007504453,0.0004669875,0.0001793291,0.000244562,0.0007236186,0.005960186],"genre_scores_gemma":[0.6965235,0.0008842255,0.2957364,0.0001619641,0.0002257797,0.0002006753,0.0003057504,0.0002945169,0.005667102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004406516,"threshold_uncertainty_score":0.02330416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019692413","doi":"10.1007/s10951-013-0350-0","title":"Single-machine scheduling with periodic maintenance to minimize makespan revisited","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Southeast University","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Upper and lower bounds; Schedule; Single-machine scheduling; Algorithm; Mathematics","authors":[{"name":"Xianyu Yu","is_ca":true},{"name":"Yulin Zhang","is_ca":false},{"name":"George Steiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01117849571369775,"gpt":0.212332870394864,"spread":0.2011543746811663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001448368,0.001055415,0.002070211,0.0007055273,0.000721248,0.001005513,0.00224941,0.0008335864,0.001956049],"category_scores_gemma":[0.003315878,0.0007380479,0.0008356495,0.00150253,0.0004560652,0.001099885,0.0005657414,0.0008709489,0.000146656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008391736,"about_ca_system_score_gemma":0.001738225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003005829,"about_ca_topic_score_gemma":0.003394602,"domain_scores_codex":[0.9994763,0.0002028628,0.00002227446,0.0001049429,0.00009657387,0.00009710452],"domain_scores_gemma":[0.9989226,0.0006952277,0.0001050043,0.00009040672,0.0001120352,0.00007460736],"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.0002777897,0.0001326796,0.0005659452,0.0002874927,0.0001785642,0.0001380804,0.00006912932,0.9312959,0.003123473,0.01213008,0.002965102,0.04883569],"study_design_scores_gemma":[0.00001792833,0.00007875072,0.0002474687,0.000009676795,0.00002869273,0.00003416803,0.00001482542,0.9927381,0.0005549362,0.005978984,0.0002911137,0.00000550474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1419033,0.003005516,0.8457916,0.0008333173,0.0005299823,0.0001984421,0.0001810424,0.0005473502,0.007009377],"genre_scores_gemma":[0.8748611,0.0006866439,0.1218298,0.0001023446,0.0001707664,0.0001014398,0.00009136822,0.000163007,0.001993609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003005829,"threshold_uncertainty_score":0.007659793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084084982","doi":"10.1007/s10951-007-0043-7","title":"Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":36,"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":"Tabu search; Variable neighborhood search; Simulated annealing; Mathematical optimization; Hill climbing; Guided Local Search; Computer science; Local search (optimization); Scheduling (production processes); Beam search; Metaheuristic; Variable (mathematics); Search algorithm; Mathematics","authors":[{"name":"V. Bouffard","is_ca":true},{"name":"Jacques A. Ferland","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01020203630421521,"gpt":0.2294490232960321,"spread":0.2192469869918169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001555472,0.0006258126,0.001436135,0.0006750134,0.0005303465,0.0005549788,0.001416821,0.001291196,0.001564542],"category_scores_gemma":[0.004709347,0.0005725886,0.0009276497,0.0007696452,0.000701022,0.0007930491,0.0007587456,0.00101048,0.0002060215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008364238,"about_ca_system_score_gemma":0.001391947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007900636,"about_ca_topic_score_gemma":0.006667608,"domain_scores_codex":[0.9991566,0.00050823,0.00002386411,0.00007133543,0.0001768049,0.00006322687],"domain_scores_gemma":[0.9985716,0.001059573,0.00007492626,0.00009882997,0.0001561526,0.00003886982],"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.00004797084,0.00003065508,0.0001400913,0.00001459614,0.0000246552,0.000009302792,0.00001785898,0.9875324,0.0003500136,0.003200696,0.0002979994,0.008333722],"study_design_scores_gemma":[0.000009949733,0.00001105493,0.00001761557,0.000001033741,0.000002925704,0.000001600554,0.000001433443,0.9990721,0.00007159259,0.0007172045,0.00009253273,9.575388e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06619765,0.0006037398,0.9262908,0.0002900847,0.0001549743,0.00009115908,0.00003258509,0.0005059448,0.00583314],"genre_scores_gemma":[0.6402707,0.0002139438,0.3563092,0.0001332987,0.0000627974,0.000254865,0.00009256315,0.0001631057,0.002499539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007900636,"threshold_uncertainty_score":0.01570928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101083305","doi":"10.1007/s10951-008-0078-4","title":"Minimizing the stretch when scheduling flows of divisible requests","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada)","funders":"","keywords":"Heuristics; Computer science; Preemption; Scheduling (production processes); Mathematical optimization; Pareto principle; Linear programming; Algorithm; Mathematics","authors":[{"name":"Arnaud Legrand","is_ca":false},{"name":"Alan Su","is_ca":true},{"name":"Frédéric Vivien","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04646876579966042,"gpt":0.2742331595174468,"spread":0.2277643937177863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001661243,0.0008588777,0.001291618,0.0007638558,0.001201752,0.001601209,0.001097366,0.0009234678,0.002544028],"category_scores_gemma":[0.006377337,0.0006927146,0.0004272224,0.001116088,0.0006512282,0.002253022,0.001368352,0.001025013,0.000138695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00151151,"about_ca_system_score_gemma":0.0009849656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002780468,"about_ca_topic_score_gemma":0.003690499,"domain_scores_codex":[0.9992513,0.0002122483,0.00003961214,0.0001100466,0.0001779548,0.0002086986],"domain_scores_gemma":[0.9972397,0.001700713,0.0003092329,0.0001717255,0.0001829917,0.0003957342],"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.002258762,0.0002668034,0.003175329,0.000265498,0.00006851751,0.0003577248,0.0003393068,0.8756825,0.01502322,0.01019101,0.002082861,0.09028838],"study_design_scores_gemma":[0.00004029988,0.0002776062,0.0007992674,0.0000137799,0.00001838958,0.00005990885,0.0001702192,0.9855933,0.002912795,0.00949055,0.0006116405,0.00001225865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7716791,0.0007650712,0.2183084,0.000791333,0.0002556945,0.0002432266,0.0002111204,0.0004747697,0.00727126],"genre_scores_gemma":[0.9632283,0.0001757289,0.03358136,0.00006130375,0.00007354275,0.00004733573,0.00009474557,0.0001038047,0.002633881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002780468,"threshold_uncertainty_score":0.01096684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081401598","doi":"10.1007/s10951-009-0109-9","title":"Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Schedule; Job scheduler; Mathematical optimization; Scheduling (production processes); Due date; Supply chain; Job shop scheduling; Batch processing; Batch production; Time complexity; Supply chain management; Parametric statistics; Algorithm; Mathematics; Operations management; Economics; Statistics; Queue; Business","authors":[{"name":"George Steiner","is_ca":true},{"name":"Rui Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01905853976061846,"gpt":0.2621603572587304,"spread":0.243101817498112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005423017,0.002030443,0.002915123,0.001346573,0.001177969,0.002738188,0.003812893,0.003017308,0.003420508],"category_scores_gemma":[0.01229887,0.001792786,0.001214362,0.002856011,0.00169954,0.003349506,0.002226779,0.002373809,0.000459875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00348123,"about_ca_system_score_gemma":0.003197534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009754174,"about_ca_topic_score_gemma":0.008622319,"domain_scores_codex":[0.9982163,0.0007267072,0.00007736484,0.0002065565,0.0003491641,0.0004239169],"domain_scores_gemma":[0.9920155,0.005950423,0.0006572181,0.0003628596,0.0005584995,0.0004554218],"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.0002322734,0.0000706531,0.0004548163,0.00007945302,0.00003732532,0.00002678241,0.00005407283,0.982514,0.0003196432,0.004216818,0.0007484143,0.0112457],"study_design_scores_gemma":[0.00002390614,0.00002404299,0.00004024407,0.000004938254,0.000007781668,0.000006750327,0.00001251358,0.9956148,0.00008729872,0.004098963,0.00007588971,0.000002968115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08412243,0.0008549994,0.9107548,0.0007981648,0.0001250514,0.0001495317,0.0001963551,0.0003925939,0.002606067],"genre_scores_gemma":[0.6798624,0.0007911864,0.3116949,0.0003378795,0.0001831321,0.0003929283,0.0005595353,0.000257461,0.005920566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009754174,"threshold_uncertainty_score":0.02868003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2596332277","doi":"10.1007/s10951-017-0513-5","title":"Solving a wind turbine maintenance scheduling problem","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wind power; Mathematical optimization; Solver; Scheduling (production processes); Turbine; Integer programming; Constraint programming; Time horizon; Job shop scheduling; Operations research; Linear programming; Context (archaeology); Industrial engineering; Schedule; Stochastic programming; Engineering; Mathematics","authors":[{"name":"Aurélien Froger","is_ca":false},{"name":"Michel Gendreau","is_ca":true},{"name":"Jorge E. Mendoza","is_ca":false},{"name":"Éric Pinson","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02165069210170227,"gpt":0.2777688907375572,"spread":0.2561181986358549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009262891,0.000852925,0.001122879,0.0005495294,0.0005502785,0.0009194437,0.001087381,0.002156551,0.004278527],"category_scores_gemma":[0.002525817,0.0007051431,0.0009196571,0.0008002034,0.0004416529,0.0008560637,0.0006042608,0.001020666,0.0002330623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006378794,"about_ca_system_score_gemma":0.001283862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007059298,"about_ca_topic_score_gemma":0.004885726,"domain_scores_codex":[0.9997303,0.0001203553,0.00001202664,0.00006465352,0.00003327398,0.00003940895],"domain_scores_gemma":[0.9989433,0.0008384101,0.00007533014,0.000032676,0.00006225328,0.00004802077],"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.00005780758,0.00007134765,0.0003455432,0.00007724083,0.00003532153,0.00007570533,0.0000259741,0.9819449,0.000541872,0.003797991,0.0009762769,0.01204994],"study_design_scores_gemma":[0.00002788627,0.00003500665,0.00008609323,0.000004155266,0.00001119299,0.00001257187,0.00001411505,0.9965795,0.0001348413,0.002765042,0.0003271225,0.000002484296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2740948,0.0008433401,0.7057787,0.001460005,0.0003367364,0.0002881641,0.0004082449,0.0002377509,0.01655227],"genre_scores_gemma":[0.7692266,0.0005635346,0.2180379,0.0001827534,0.0002057952,0.0002421685,0.0004174038,0.0001274453,0.01099632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007059298,"threshold_uncertainty_score":0.01431316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3205443176","doi":"10.1007/s10951-021-00711-9","title":"Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times","year":2021,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Université de Genève; European Commission","keywords":"Tabu search; Metaheuristic; Lexicographical order; Mathematical optimization; Job shop scheduling; Computer science; Scheduling (production processes); Minification; Hierarchy; Guided Local Search; Single-machine scheduling; Mathematics; Schedule; Combinatorics","authors":[{"name":"Hanane Krim","is_ca":false},{"name":"Nicolas Zufferey","is_ca":false},{"name":"Jean‐Yves Potvin","is_ca":true},{"name":"Rachid Benmansour","is_ca":false},{"name":"David Duvivier","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01268171912289581,"gpt":0.2344862857258268,"spread":0.221804566602931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001258677,0.0008757097,0.001135216,0.0009310317,0.0007131131,0.001153185,0.001171199,0.001382977,0.002792898],"category_scores_gemma":[0.00273827,0.0004936363,0.000655802,0.0016476,0.0006144667,0.0007469192,0.0005665058,0.0008643249,0.0003233187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118569,"about_ca_system_score_gemma":0.001911073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007396626,"about_ca_topic_score_gemma":0.00676887,"domain_scores_codex":[0.9994923,0.0003034043,0.00001386508,0.00006194699,0.00006471312,0.00006386216],"domain_scores_gemma":[0.9990764,0.000693417,0.00008544247,0.00003543527,0.00007403758,0.00003534148],"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.00006079927,0.00005560223,0.0001963566,0.00006178323,0.00002025936,0.00003826978,0.00002537141,0.9847489,0.0004052027,0.004158189,0.0003737554,0.009855567],"study_design_scores_gemma":[0.00001555703,0.00003396488,0.00006554435,0.000004810509,0.000006803867,0.00001218224,0.00001810108,0.9973966,0.0001922213,0.001913323,0.0003377199,0.00000314277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2371775,0.001231935,0.7511,0.0004799789,0.00009291249,0.0002292357,0.0003565836,0.0005103739,0.008821528],"genre_scores_gemma":[0.6373724,0.0006020411,0.3567898,0.0001168427,0.00005500627,0.0004553902,0.0003863248,0.0001702901,0.004051818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007396626,"threshold_uncertainty_score":0.01470715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056881568","doi":"10.1007/s10951-007-0025-9","title":"Single machine batch scheduling to minimize total completion time and resource consumption costs","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Job scheduler; Partition (number theory); Scheduling (production processes); Job queue; Batch processing; Job shop scheduling; Non-renewable resource; Resource consumption; Batch production; Time complexity; Mathematical optimization; Operations research; Operations management; Algorithm; Schedule; Mathematics; Economics; Engineering; Operating system","authors":[{"name":"Dvir Shabtay","is_ca":true},{"name":"George Steiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01510272516198847,"gpt":0.2389728532338516,"spread":0.2238701280718632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156801,0.001107299,0.002527435,0.001187696,0.0008152988,0.001204147,0.001778153,0.0009715289,0.00398381],"category_scores_gemma":[0.00267823,0.0007769735,0.0008284095,0.002536076,0.0005172493,0.001211081,0.0004837803,0.0008556846,0.0004577516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00171387,"about_ca_system_score_gemma":0.002832128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005263982,"about_ca_topic_score_gemma":0.00744525,"domain_scores_codex":[0.9992093,0.0002220975,0.00003505641,0.0001549623,0.0002194798,0.0001590828],"domain_scores_gemma":[0.998473,0.0009326581,0.0001396064,0.0001108223,0.0002389319,0.000105063],"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.0004952464,0.0002243389,0.0003537838,0.0001966579,0.00007355877,0.00005426879,0.0000384612,0.9319128,0.00878522,0.004574912,0.003827994,0.04946266],"study_design_scores_gemma":[0.0000320235,0.00009355252,0.0002279513,0.000003750257,0.00001643479,0.00001458097,0.000009373295,0.9950841,0.002102303,0.002077525,0.0003321926,0.000006248035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1853488,0.0009714607,0.8032795,0.0005070487,0.000393823,0.0004370345,0.0006233933,0.001282576,0.007156349],"genre_scores_gemma":[0.7131025,0.0003745979,0.2759288,0.0001007975,0.000155143,0.0003291276,0.0004151391,0.0003997459,0.009194199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005263982,"threshold_uncertainty_score":0.01332712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167699778","doi":"10.1007/s10951-010-0179-8","title":"Assigning multiple activities to work shifts","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kronos (Canada); Université Laval; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Time horizon; Heuristic; Computer science; Integer programming; Operations research; Mathematical optimization; Work (physics); Column generation; Mathematics; Engineering","authors":[{"name":"Quentin Lequy","is_ca":true},{"name":"Mathieu Bouchard","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"François Soumis","is_ca":true},{"name":"B Tachefine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09904310839770022,"gpt":0.3810197728663123,"spread":0.2819766644686121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002027223,0.0008675444,0.001096782,0.001215614,0.001632831,0.00188679,0.001896225,0.0010867,0.01176404],"category_scores_gemma":[0.004851375,0.0006933811,0.001111313,0.001579987,0.000529946,0.001462689,0.001502417,0.001563973,0.001188056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00127577,"about_ca_system_score_gemma":0.00272872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003117598,"about_ca_topic_score_gemma":0.00470575,"domain_scores_codex":[0.9982886,0.0005776812,0.0001005578,0.000324482,0.0002940542,0.0004146026],"domain_scores_gemma":[0.9978017,0.0006874893,0.0002083804,0.0003559344,0.0003919216,0.0005544989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002719412,0.002553488,0.01074139,0.0005567885,0.0001894076,0.0003392594,0.0006855104,0.4104505,0.02531897,0.01572724,0.003473559,0.5272446],"study_design_scores_gemma":[0.0003845036,0.002678491,0.01356703,0.000104453,0.0002155917,0.0002622207,0.001901306,0.8834075,0.01909868,0.06506466,0.01320118,0.0001143997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5474493,0.0003108757,0.4273682,0.0006065194,0.0005099453,0.002085079,0.0003818498,0.0005776449,0.02071069],"genre_scores_gemma":[0.8646132,0.0001376635,0.1273342,0.00005921473,0.00006736137,0.0003872363,0.0001488476,0.00006860832,0.007183552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01176404,"threshold_uncertainty_score":0.03935468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117593136","doi":"10.1007/s10951-015-0416-2","title":"A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines","year":2015,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Innovation Foundation; University of Toronto","keywords":"Time horizon; Scheduling (production processes); Computer science; Schedule; Job shop scheduling; Production planning; Production schedule; Optimal maintenance; Integrated production; Interdependence; Production (economics); Mathematical optimization; Operations research; Reliability engineering; Engineering; Mathematics","authors":[{"name":"Maliheh Aramon Bajestani","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0268962343858004,"gpt":0.275037016954549,"spread":0.2481407825687486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00186006,0.001086664,0.001696668,0.0008284904,0.0008362377,0.001413596,0.003281064,0.002412873,0.005082378],"category_scores_gemma":[0.003125651,0.00134724,0.001034258,0.0009369962,0.0008425239,0.001533492,0.002550559,0.001484958,0.0005113746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085627,"about_ca_system_score_gemma":0.002372134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008760974,"about_ca_topic_score_gemma":0.008772808,"domain_scores_codex":[0.9993595,0.0001751253,0.00003569829,0.0001397461,0.0001721907,0.0001177297],"domain_scores_gemma":[0.998639,0.000826608,0.0001054914,0.00008569504,0.0002144552,0.0001287989],"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.0002408041,0.000120797,0.0003719094,0.00007509183,0.00004989141,0.00005774201,0.00006544481,0.9592256,0.001555002,0.003777931,0.0007153839,0.03374442],"study_design_scores_gemma":[0.00002958388,0.00003277633,0.00003822489,0.000002543985,0.000007295082,0.000005347779,0.000003746923,0.9990869,0.0001239407,0.0005538589,0.000112309,0.00000354736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02953519,0.0001344108,0.966599,0.0001282971,0.00005070122,0.0001522737,0.00004968715,0.0003357171,0.003014786],"genre_scores_gemma":[0.5074536,0.000115385,0.4873034,0.0001904747,0.00005549113,0.0005509478,0.0001940889,0.0001602177,0.00397634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008760974,"threshold_uncertainty_score":0.01741999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029826506","doi":"10.1007/s10951-010-0208-7","title":"A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Function (biology); Single-machine scheduling; Due date; Regular polygon; Assignment problem; Time complexity; Resource consumption; Convex function; Job shop scheduling; Mathematics; Algorithm","authors":[{"name":"Dvir Shabtay","is_ca":false},{"name":"George Steiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006204005759576244,"gpt":0.2150202417603225,"spread":0.2088162360007462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002168503,0.001605138,0.002203523,0.001221548,0.000569178,0.001400863,0.001996004,0.001483375,0.00433091],"category_scores_gemma":[0.003580265,0.001324556,0.001090865,0.00147827,0.001145652,0.001143456,0.001256786,0.001583946,0.0008740337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127872,"about_ca_system_score_gemma":0.00191447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004694135,"about_ca_topic_score_gemma":0.00462531,"domain_scores_codex":[0.9986738,0.0005877445,0.00004997053,0.0002018319,0.0003193613,0.0001672514],"domain_scores_gemma":[0.9986168,0.0007528245,0.0001343223,0.00008651221,0.0003329893,0.00007655563],"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.0001769781,0.00009479172,0.0001526572,0.0001115151,0.00006418113,0.00004881284,0.00006622175,0.956935,0.002249329,0.01445312,0.001719312,0.02392805],"study_design_scores_gemma":[0.00001712357,0.00004608884,0.00004379676,0.00000684125,0.000006091463,0.00001384902,0.000008509364,0.9942591,0.0002575792,0.004964986,0.0003691014,0.00000674221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009029121,0.0001801109,0.9874047,0.0001206664,0.00005529264,0.00005813815,0.0000426003,0.0001285224,0.002980835],"genre_scores_gemma":[0.4106587,0.0005125335,0.5755313,0.0003535428,0.000143862,0.0005907558,0.0002820125,0.0004394506,0.01148787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004694135,"threshold_uncertainty_score":0.01448834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123490024","doi":"10.1007/s10951-008-0068-6","title":"A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Mathematical optimization; Computer science; Single-machine scheduling; Scheduling (production processes); Job shop scheduling; Heuristic; Guided Local Search; Sequence (biology); Operations research; Mathematics; Schedule","authors":[{"name":"Gabriella Stecco","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"E. Moretti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03508282374171459,"gpt":0.2563421948947129,"spread":0.2212593711529983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742299,0.0008722507,0.001785925,0.001705635,0.001158815,0.001300721,0.002304553,0.002186312,0.006732625],"category_scores_gemma":[0.004368448,0.001217295,0.001032024,0.002557745,0.0009010942,0.001416755,0.0009532143,0.001265528,0.0007288373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0016304,"about_ca_system_score_gemma":0.00259179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008755484,"about_ca_topic_score_gemma":0.009214545,"domain_scores_codex":[0.999375,0.0002894157,0.00002658302,0.00008508984,0.0001161495,0.0001077341],"domain_scores_gemma":[0.9972906,0.001976494,0.0001684483,0.0001374958,0.0002887781,0.0001382218],"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.0002289201,0.0001390186,0.0002437713,0.00009284132,0.00004465123,0.00006094434,0.00003730793,0.9484671,0.0008897213,0.003071883,0.002351548,0.04437236],"study_design_scores_gemma":[0.00005879231,0.00006324975,0.00007759483,0.000008172696,0.00001438873,0.00001183935,0.00001265064,0.9977372,0.0002212245,0.001415425,0.0003726698,0.000006773155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.154383,0.002064494,0.8260021,0.0008250588,0.0004351357,0.0005438076,0.0005623341,0.00231636,0.01286772],"genre_scores_gemma":[0.4256868,0.0004359698,0.5687166,0.0002728272,0.00009566921,0.0005144892,0.0005355888,0.0003390563,0.003402941],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008755484,"threshold_uncertainty_score":0.02252281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025689931","doi":"10.1007/s10951-013-0338-9","title":"A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":24,"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; Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematical optimization; Scheduling (production processes); Task (project management); Job shop scheduling; Set (abstract data type); Mathematics; Economics","authors":[{"name":"Vincent Boyer","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1176176703911333,"gpt":0.3762298569327138,"spread":0.2586121865415806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575002,0.001137916,0.002450224,0.001516341,0.001159994,0.001679559,0.002104881,0.002557659,0.01058606],"category_scores_gemma":[0.003212596,0.0009736482,0.0009780085,0.002131559,0.000662062,0.001973977,0.001416075,0.002105957,0.001085308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001408789,"about_ca_system_score_gemma":0.003435202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01107365,"about_ca_topic_score_gemma":0.009686693,"domain_scores_codex":[0.9993851,0.0001775764,0.00002779994,0.00008908648,0.0001865527,0.0001338994],"domain_scores_gemma":[0.9985618,0.001011565,0.00006906657,0.00005016105,0.000181847,0.0001256063],"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.000424107,0.0003977568,0.0005255836,0.0001989075,0.00006954021,0.0000867468,0.00008870448,0.7443095,0.002315286,0.01412451,0.007786757,0.2296727],"study_design_scores_gemma":[0.00009406194,0.00006398637,0.00007935167,0.000007854377,0.00001317063,0.00001352928,0.00001363841,0.9941169,0.0001992771,0.004738608,0.0006531519,0.000006422158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02656123,0.0005586134,0.9634442,0.0006208772,0.0001835098,0.0003127924,0.0001966648,0.0008954515,0.007226578],"genre_scores_gemma":[0.2220838,0.0005099044,0.7702034,0.0002020117,0.0001441994,0.0005067028,0.0004956086,0.0002785926,0.005575775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01107365,"threshold_uncertainty_score":0.03541386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994932061","doi":"10.1007/s10951-014-0383-z","title":"Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic","year":2014,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":23,"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":"Staffing; Mathematical optimization; Tabu search; Computer science; Job shop scheduling; Scheduling (production processes); Heuristic; Workforce; Construct (python library); Operations research; Schedule; Mathematics; Economics","authors":[{"name":"Sana Dahmen","is_ca":true},{"name":"Monia Rekik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.109235192156957,"gpt":0.3547160647951978,"spread":0.2454808726382408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254775,0.0008620823,0.001387235,0.001805778,0.0006700701,0.001419575,0.001672553,0.001779038,0.002939183],"category_scores_gemma":[0.00187723,0.0008377299,0.001284621,0.001688033,0.0005018885,0.001067847,0.0009473581,0.000731769,0.0002061782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001013516,"about_ca_system_score_gemma":0.001806271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007989476,"about_ca_topic_score_gemma":0.007689212,"domain_scores_codex":[0.9994262,0.0002204462,0.00003491007,0.00008152955,0.0001095445,0.0001273888],"domain_scores_gemma":[0.9985076,0.001141384,0.0000889581,0.00006053354,0.0001181048,0.00008350117],"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.0001826857,0.0001706539,0.0004783023,0.0001082224,0.00008747409,0.0000531915,0.00003747708,0.9638593,0.001390797,0.002368964,0.0004136331,0.0308493],"study_design_scores_gemma":[0.00004848143,0.00008838429,0.0001112934,0.00000663113,0.00002460927,0.00001084012,0.00001908614,0.9982443,0.0002710387,0.0009621187,0.0002074172,0.000005840227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2557764,0.0009749988,0.7266912,0.0003480162,0.0002007174,0.0004170571,0.000229842,0.0006735098,0.01468822],"genre_scores_gemma":[0.7343761,0.0002937711,0.2619506,0.0001177117,0.0000655769,0.0004487051,0.0001887562,0.00006962865,0.002489131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007989476,"threshold_uncertainty_score":0.01588595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2981427367","doi":"10.1007/s10951-019-00627-5","title":"Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant","year":2019,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Scale (ratio); Horizon; Computer science; Operations research; Time horizon; Operations management; Industrial engineering; Mathematical optimization; Business; Engineering; Mathematics; Geography; Cartography","authors":[{"name":"Zachariah Stevenson","is_ca":true},{"name":"Ricardo Fukasawa","is_ca":true},{"name":"Luis Ricardez‐Sandoval","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07007471513145623,"gpt":0.3256633989004481,"spread":0.2555886837689919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002969709,0.0008959199,0.001320952,0.0006402178,0.0006716851,0.001042308,0.0009298096,0.001239612,0.001246009],"category_scores_gemma":[0.004447784,0.0005778309,0.0005606347,0.0005891608,0.0006501919,0.0007694297,0.0005914915,0.000777493,0.00006946703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001997717,"about_ca_system_score_gemma":0.002414665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03869518,"about_ca_topic_score_gemma":0.02131028,"domain_scores_codex":[0.9992091,0.0004187677,0.00002878205,0.00009843763,0.0001180085,0.0001268979],"domain_scores_gemma":[0.9964431,0.002814547,0.0002074141,0.00009189823,0.0002618097,0.0001812562],"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.00009214,0.00005740373,0.0002880426,0.00001706849,0.00001113003,0.00002845607,0.000006039246,0.9972255,0.0002677697,0.0002701766,0.0000508436,0.001685387],"study_design_scores_gemma":[0.000005851786,0.00003893469,0.0001452459,7.039728e-7,0.000003440137,0.000001742981,0.000006193764,0.999606,0.00008443629,0.00009694343,0.000008698165,0.000001871719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9496498,0.0002978374,0.04644198,0.0002053966,0.00003047491,0.0001124309,0.0001550723,0.0002205653,0.002886417],"genre_scores_gemma":[0.9936455,0.00004175756,0.005936633,0.000009168231,0.000004083943,0.00001515234,0.00004508903,0.000009394299,0.0002933306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03869518,"threshold_uncertainty_score":0.07693994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965105237","doi":"10.1007/s10951-011-0264-7","title":"Semi-online two-level supply chain scheduling problems","year":2011,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Competitive analysis; Online algorithm; Supply chain; A priori and a posteriori; Scheduling (production processes); Supply chain management; Computer science; Mathematical optimization; Upper and lower bounds; Job shop scheduling; Lost sales; Operations research; Mathematics; Business; Schedule; Marketing","authors":[{"name":"Igor Averbakh","is_ca":true},{"name":"Mehmet Baysan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0427090246435247,"gpt":0.245424681843225,"spread":0.2027156571997003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004659467,0.001749704,0.004803298,0.001065298,0.00112302,0.003885126,0.004131217,0.003868059,0.01053661],"category_scores_gemma":[0.01101661,0.001746232,0.001548936,0.002325331,0.001769631,0.005885447,0.004066499,0.002798591,0.0008166474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002003792,"about_ca_system_score_gemma":0.002634505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003240436,"about_ca_topic_score_gemma":0.002972248,"domain_scores_codex":[0.9968419,0.001330567,0.0001651234,0.0005389384,0.0004530636,0.0006702516],"domain_scores_gemma":[0.9858769,0.01038749,0.001101067,0.0007105584,0.0007772995,0.001146633],"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.0009735657,0.0004270351,0.0007473855,0.0004400414,0.0001408024,0.0003202812,0.0001088522,0.9395725,0.001061342,0.03057272,0.002798161,0.0228373],"study_design_scores_gemma":[0.00007651267,0.00009780306,0.0001420843,0.00001078793,0.00001800479,0.00003172174,0.00002617532,0.9803981,0.0002962955,0.01856942,0.0003203819,0.00001273733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1097822,0.0007943954,0.8742915,0.00170549,0.000246685,0.0003362437,0.001395201,0.0004299339,0.01101827],"genre_scores_gemma":[0.875542,0.000577527,0.1111973,0.0002949843,0.0002660264,0.0003495787,0.00119998,0.0001725056,0.01040015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01053661,"threshold_uncertainty_score":0.03524846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069541979","doi":"10.1007/s10951-011-0255-8","title":"Single machine batch scheduling with release times and delivery costs","year":2011,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Windsor","funders":"","keywords":"Metaheuristic; Mathematical optimization; Computer science; Job shop scheduling; Single-machine scheduling; Scheduling (production processes); Mathematics","authors":[{"name":"Esaignani Selvarajah","is_ca":true},{"name":"George Steiner","is_ca":true},{"name":"Rui Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01576189520683019,"gpt":0.1994266802483037,"spread":0.1836647850414735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005249418,0.002163115,0.00396286,0.001425339,0.0009252844,0.00333338,0.003250882,0.001967421,0.002845803],"category_scores_gemma":[0.01324869,0.002404557,0.001596111,0.003643443,0.001151957,0.003934684,0.001026228,0.002766454,0.0005534347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002426996,"about_ca_system_score_gemma":0.00206691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003290756,"about_ca_topic_score_gemma":0.002821947,"domain_scores_codex":[0.9974067,0.001023753,0.0001400588,0.0004787048,0.0005722628,0.0003785957],"domain_scores_gemma":[0.9888635,0.008272748,0.0008855225,0.0009285866,0.0006619502,0.0003877324],"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.0005059796,0.00008612176,0.0002867029,0.0001487212,0.00005762262,0.0001231827,0.00002140529,0.9718865,0.001441627,0.01130408,0.0009264244,0.01321169],"study_design_scores_gemma":[0.0000259799,0.00005799225,0.000167919,0.00000561049,0.00002210779,0.00002827058,0.00000527459,0.9908178,0.0005161921,0.008171054,0.0001693726,0.00001251044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1068336,0.002258945,0.8842626,0.0006942744,0.0004078487,0.0002105179,0.0004973728,0.000620058,0.00421477],"genre_scores_gemma":[0.8586813,0.000954213,0.1305567,0.00008263583,0.0004415513,0.0002044728,0.000379969,0.0003072587,0.008391859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005249418,"threshold_uncertainty_score":0.02776194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2582191864","doi":"10.1007/s10951-018-0575-z","title":"Rescheduling due to machine disruption to minimize the total weighted completion time","year":2018,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Ningbo; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Unavailability; Mathematical optimization; Interval (graph theory); Time complexity; Computer science; Function (biology); Schedule; Standard deviation; Constraint (computer-aided design); Time constraint; Planner; Bounded function; Mathematics; Polynomial-time approximation scheme; Algorithm; Statistics; Artificial intelligence; Combinatorics","authors":[{"name":"Wenchang Luo","is_ca":true},{"name":"Taibo Luo","is_ca":true},{"name":"Randy Goebel","is_ca":true},{"name":"Guohui Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01121297589495896,"gpt":0.2410873684386168,"spread":0.2298743925436578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001939385,0.0009256212,0.00154262,0.0006670958,0.0006657753,0.0009438004,0.001464086,0.0009058431,0.00195685],"category_scores_gemma":[0.003317349,0.0004891952,0.0005489272,0.001114541,0.0004984195,0.0008807326,0.0006231195,0.001029351,0.0002468977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001194929,"about_ca_system_score_gemma":0.002615226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004917456,"about_ca_topic_score_gemma":0.004494156,"domain_scores_codex":[0.9991203,0.0002995519,0.00003812205,0.000142314,0.0001851317,0.0002146101],"domain_scores_gemma":[0.9986662,0.0006011015,0.0002048541,0.0001166079,0.0002420868,0.0001692112],"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.0003367489,0.0001129467,0.0005108476,0.00009107394,0.00004323247,0.0001088851,0.00004577783,0.9690558,0.003801014,0.003703099,0.001603239,0.02058728],"study_design_scores_gemma":[0.00001078648,0.00005286363,0.0001988348,0.000002144854,0.000007503122,0.00001785752,0.00001137896,0.997525,0.0005292956,0.00146409,0.0001773027,0.000002811879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3416632,0.0007615038,0.6493604,0.0007302636,0.0003211443,0.0003058727,0.0003094653,0.0006955237,0.00585257],"genre_scores_gemma":[0.9312418,0.0001716112,0.06437732,0.00007703436,0.00006659892,0.00009170226,0.0001883901,0.0001293619,0.003656169],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004917456,"threshold_uncertainty_score":0.01025659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1729082581","doi":"10.1023/a:1022985808959","title":"Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","authors":[{"name":"Eric Bach","is_ca":false},{"name":"Joan Boyar","is_ca":false},{"name":"Leah Epstein","is_ca":false},{"name":"Lene M. Favrholdt","is_ca":false},{"name":"Tao Jiang","is_ca":false},{"name":"Kim S. Larsen","is_ca":false},{"name":"Guohui Lin","is_ca":true},{"name":"Rob van Stee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06805300057024483,"gpt":0.3062754475526015,"spread":0.2382224469823567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01009454,0.004593094,0.006067515,0.003667214,0.002723819,0.007593613,0.006481047,0.004262837,0.01884875],"category_scores_gemma":[0.05372881,0.002071407,0.002155064,0.005455344,0.003078457,0.008603452,0.004120458,0.008484297,0.00256795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004434586,"about_ca_system_score_gemma":0.005050736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004699998,"about_ca_topic_score_gemma":0.004402115,"domain_scores_codex":[0.9920718,0.002976337,0.0002391507,0.0006178263,0.002116899,0.001977928],"domain_scores_gemma":[0.9340953,0.05637984,0.002032271,0.001950816,0.002565809,0.002975999],"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.004284109,0.001356778,0.001985692,0.001280596,0.0002885456,0.0003380597,0.0005415043,0.5424319,0.009144973,0.3226039,0.02566896,0.09007508],"study_design_scores_gemma":[0.0002058932,0.0004998806,0.00057321,0.0001299619,0.00009374169,0.0002475403,0.0001631283,0.8067396,0.00138536,0.1866637,0.003239464,0.00005844751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2750376,0.01301508,0.5472102,0.008221693,0.001243607,0.000715206,0.002345105,0.001651815,0.1505598],"genre_scores_gemma":[0.837622,0.007674343,0.1318429,0.001950126,0.001771293,0.0008330075,0.00176515,0.001011182,0.01552998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01884875,"threshold_uncertainty_score":0.06305534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062601646","doi":"10.1007/s10951-005-5314-6","title":"Scheduling in Reentrant Robotic Cells: Algorithms and Complexity","year":2005,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reentrancy; Job shop scheduling; Scheduling (production processes); Computer science; Robot; Minification; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Embedded system; Routing (electronic design automation)","authors":[{"name":"George Steiner","is_ca":true},{"name":"Zhihui Xue","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02816764618713669,"gpt":0.2474518550998317,"spread":0.219284208912695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000996875,0.0005876105,0.001244,0.0004071266,0.0009750308,0.001992148,0.002024357,0.001151766,0.004219808],"category_scores_gemma":[0.004538326,0.0005516941,0.0007032677,0.001042654,0.001086561,0.002416773,0.001371295,0.001318645,0.0004486336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001431616,"about_ca_system_score_gemma":0.001307054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01100366,"about_ca_topic_score_gemma":0.008754499,"domain_scores_codex":[0.9995352,0.0001356326,0.00002096182,0.0001017245,0.0001059136,0.0001005946],"domain_scores_gemma":[0.9973602,0.001932169,0.0002209387,0.0002018477,0.0001731879,0.0001116409],"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.0001009711,0.0000424172,0.000433713,0.00005687655,0.00001848798,0.00006127072,0.00008871481,0.9459798,0.0008353971,0.02787381,0.001210603,0.02329803],"study_design_scores_gemma":[0.00001969487,0.00002065087,0.00007135182,0.000003323822,0.000005108159,0.00001256814,0.00002858277,0.9832645,0.0002929475,0.01571495,0.0005623594,0.000003924597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1794009,0.0006076675,0.8092227,0.0005713966,0.00009926135,0.0001605144,0.000203071,0.0003499479,0.009384569],"genre_scores_gemma":[0.715591,0.0008265952,0.2705576,0.0001631518,0.00009489572,0.000242617,0.0003747562,0.0001641602,0.01198525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01100366,"threshold_uncertainty_score":0.02187926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2527830873","doi":"10.1007/s10951-018-0582-0","title":"Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem","year":2018,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","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; Group for Research in Decision Analysis; HEC Montréal","funders":"Danish Agency for Science and Higher Education; Natural Sciences and Engineering Research Council of Canada","keywords":"Course (navigation); Preprocessor; Computer science; Set (abstract data type); Integer programming; Mathematical optimization; Relaxation (psychology); Linear programming relaxation; Integer (computer science); Mathematics; Artificial intelligence; Programming language; Engineering","authors":[{"name":"Niels-Christian Fink Bagger","is_ca":false},{"name":"Guy Desaulniers","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.121475084416777,"gpt":0.4068748154038947,"spread":0.2853997309871177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002395578,0.001115397,0.001192334,0.001298522,0.0006250517,0.002304329,0.0027484,0.001690915,0.009174614],"category_scores_gemma":[0.009832488,0.000852895,0.002166986,0.002093159,0.0009725105,0.002673566,0.001529918,0.003604632,0.0005778747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002333775,"about_ca_system_score_gemma":0.004223909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02020943,"about_ca_topic_score_gemma":0.01915943,"domain_scores_codex":[0.9976872,0.0006649107,0.0001140715,0.0004298713,0.000667233,0.0004367666],"domain_scores_gemma":[0.9948764,0.003535727,0.0004275609,0.0002773338,0.0006684378,0.0002145914],"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.000229143,0.0005509702,0.001945109,0.0004418654,0.0001128397,0.0002165926,0.0002286444,0.7314302,0.002960459,0.1776667,0.009524061,0.07469349],"study_design_scores_gemma":[0.00003567697,0.00009255235,0.0005549017,0.00004636083,0.00002567957,0.00004123779,0.00006943647,0.9155098,0.0007422367,0.0805263,0.002336314,0.00001942759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03224292,0.0003600965,0.9506649,0.001104028,0.0001410141,0.0003020667,0.001576727,0.0001243942,0.01348394],"genre_scores_gemma":[0.4153441,0.0008331052,0.5614386,0.0004097245,0.0002990437,0.001013386,0.004338804,0.0002155093,0.01610772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02020943,"threshold_uncertainty_score":0.0401836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2761748578","doi":"10.1007/s10951-017-0545-x","title":"Two-stage hybrid flowshop scheduling with simultaneous processing machines","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Beijing Municipal Natural Science Foundation; Natural Sciences and Engineering Research Council of Canada; China Scholarship Council; China Postdoctoral Science Foundation","keywords":"Heuristics; Computer science; Mathematical optimization; Idle; Scheduling (production processes); Job shop scheduling; Flow shop scheduling; Heuristic; Integer programming; Algorithm; Mathematics","authors":[{"name":"Bailin Wang","is_ca":false},{"name":"Kai Huang","is_ca":true},{"name":"Tieke Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01339178228269089,"gpt":0.2608581204676207,"spread":0.2474663381849298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009654725,0.0006854453,0.001079708,0.000533612,0.0007987375,0.0009949066,0.001846874,0.0008195337,0.003140469],"category_scores_gemma":[0.001258102,0.0007482804,0.0007732891,0.000792785,0.0003899453,0.001182783,0.001154331,0.0007275954,0.0002870669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004513173,"about_ca_system_score_gemma":0.0008380034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001790483,"about_ca_topic_score_gemma":0.002999187,"domain_scores_codex":[0.9993526,0.0002058774,0.00003118405,0.00011406,0.0001273002,0.0001689119],"domain_scores_gemma":[0.9989917,0.0005494951,0.00007247047,0.0001398971,0.0001433199,0.0001031968],"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.001445362,0.0002833369,0.001137281,0.0002344944,0.0001267373,0.0003685309,0.0001314374,0.8804542,0.02851984,0.009792862,0.001552821,0.07595314],"study_design_scores_gemma":[0.00003712168,0.0001788781,0.000213247,0.000003001386,0.00001472035,0.00003017174,0.00001163771,0.994778,0.002204442,0.002190769,0.0003270578,0.00001085871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1950694,0.0002276251,0.798069,0.0001307794,0.0001505381,0.0001676284,0.0001403984,0.0006588239,0.005385763],"genre_scores_gemma":[0.8793609,0.00005153684,0.1174316,0.00003742386,0.00004029856,0.0001442932,0.0001040442,0.00004850913,0.00278136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003140469,"threshold_uncertainty_score":0.01050597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972282966","doi":"10.1007/s10951-007-0050-8","title":"Preemptive open shop scheduling with multiprocessors: polynomial cases and applications","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Multiprocessor scheduling; Rounding; Time complexity; Multiprocessing; Scheduling (production processes); Open shop; Integer programming; Job shop scheduling; Flow shop scheduling; Mathematical optimization; Mathematics; Algorithm; Schedule; Operating system","authors":[{"name":"D. de Werra","is_ca":false},{"name":"Tamás Kis","is_ca":false},{"name":"Wiesław Kubiak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01826334746394033,"gpt":0.2713019003888697,"spread":0.2530385529249294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002733138,0.001548776,0.002035556,0.001365254,0.001623114,0.002622783,0.002427235,0.00220155,0.004633748],"category_scores_gemma":[0.0159634,0.001023709,0.001378334,0.003497205,0.002140047,0.003420732,0.002059548,0.002512814,0.0003613774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503682,"about_ca_system_score_gemma":0.001317477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004984495,"about_ca_topic_score_gemma":0.005022205,"domain_scores_codex":[0.9985643,0.0005365124,0.00006433727,0.0001496079,0.0003272839,0.0003581302],"domain_scores_gemma":[0.9871902,0.01040147,0.0009133703,0.0004577011,0.000509313,0.0005280325],"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.0006707162,0.0004907792,0.001546179,0.0004457047,0.00008362978,0.001624063,0.0003482754,0.5429992,0.001631886,0.4080494,0.006574493,0.03553567],"study_design_scores_gemma":[0.0001054365,0.00006027251,0.0002528996,0.00001370019,0.00003013382,0.0002428345,0.0001170058,0.8697953,0.000394904,0.12797,0.0009997514,0.00001771382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2440321,0.00383479,0.7055122,0.002372473,0.0003112634,0.0001846541,0.0005588722,0.0003584287,0.04283521],"genre_scores_gemma":[0.9089556,0.002064246,0.07846623,0.0001019491,0.0004042768,0.000134884,0.0001839946,0.00009621298,0.009592608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004984495,"threshold_uncertainty_score":0.01550144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963347283","doi":"10.1007/s10951-019-00622-w","title":"Single-machine scheduling with job-dependent machine deterioration","year":2019,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Ningbo; China Scholarship Council","keywords":"Computer science; Single-machine scheduling; Job shop scheduling; Scheduling (production processes); Schedule; Mathematical optimization; Algorithm; Mathematics; Operating system","authors":[{"name":"Wenchang Luo","is_ca":true},{"name":"Yao Xu","is_ca":true},{"name":"Weitian Tong","is_ca":false},{"name":"Guohui Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01014554047666777,"gpt":0.2135125582657752,"spread":0.2033670177891074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003612768,0.0009353863,0.002234254,0.0006812701,0.0009732136,0.0009554019,0.00221293,0.0009859717,0.00161315],"category_scores_gemma":[0.009013185,0.0007119706,0.0008433126,0.001162579,0.0008344695,0.001421736,0.001076376,0.001603015,0.0003584734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106738,"about_ca_system_score_gemma":0.001592041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0018946,"about_ca_topic_score_gemma":0.002033624,"domain_scores_codex":[0.9989476,0.0003396877,0.00005858055,0.0002379784,0.00022569,0.0001905417],"domain_scores_gemma":[0.9956103,0.002331051,0.000450368,0.0006331831,0.0006592475,0.0003157694],"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.0004444442,0.00009441894,0.001488416,0.0001306149,0.00005171477,0.0001567196,0.00005070156,0.9672748,0.003185825,0.004879768,0.001089869,0.02115269],"study_design_scores_gemma":[0.00001269886,0.0000469086,0.0003049458,0.000002289436,0.000006483751,0.0000276004,0.000003909611,0.9965162,0.0004776649,0.00247149,0.0001258893,0.000003860847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1834174,0.0008715556,0.8109252,0.0004172404,0.0003430231,0.0001634238,0.0002334846,0.0007815338,0.002847312],"genre_scores_gemma":[0.940089,0.000157299,0.05696283,0.00005348675,0.00008787564,0.00006461993,0.000160708,0.000082278,0.00234188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003612768,"threshold_uncertainty_score":0.01910639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2761740106","doi":"10.1007/s10951-017-0544-y","title":"An implicit model for multi-activity shift scheduling problems","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Construct (python library); Mathematics; Programming language","authors":[{"name":"Sana Dahmen","is_ca":true},{"name":"Monia Rekik","is_ca":true},{"name":"François Soumis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3347182439140028,"gpt":0.4707354262469032,"spread":0.1360171823329004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192384,0.0006568171,0.001048593,0.0005851399,0.0004530082,0.001593965,0.002708352,0.001590164,0.004671982],"category_scores_gemma":[0.004129973,0.0007133479,0.0009545998,0.001078218,0.0008281261,0.002460072,0.00137937,0.002149227,0.0005462458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001156469,"about_ca_system_score_gemma":0.001809892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005128907,"about_ca_topic_score_gemma":0.006840013,"domain_scores_codex":[0.9993085,0.00024266,0.00003459576,0.0001090279,0.0001841401,0.0001210703],"domain_scores_gemma":[0.9987246,0.0007616929,0.0001573489,0.0001011229,0.0001727614,0.0000823571],"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.00008620728,0.0000755273,0.0003294489,0.00008807422,0.00001887853,0.00007226191,0.0001106517,0.809553,0.0009105012,0.1785136,0.0007023353,0.009539524],"study_design_scores_gemma":[0.00001496188,0.00001656065,0.00004450868,0.000006274799,0.000007832817,0.0000086038,0.000008687105,0.9698533,0.00009176642,0.02900311,0.0009401201,0.00000426244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03946988,0.0002271929,0.9515007,0.0005681915,0.00006099461,0.00006365086,0.0002783737,0.00009993584,0.007731216],"genre_scores_gemma":[0.787247,0.0007684883,0.1865276,0.0001304684,0.0001321371,0.0004277426,0.0006160178,0.0001002711,0.02405031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005128907,"threshold_uncertainty_score":0.01562935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977506979","doi":"10.1007/s10951-013-0324-2","title":"A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Heuristic; Scheduling (production processes); Time horizon; Schedule; Work (physics); Integer programming; Mathematical optimization; Operations research; Task (project management); Algorithm; Mathematics; Artificial intelligence; Engineering","authors":[{"name":"Mahsa Elahipanah","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"Ève Lacasse-Guay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1220738627681667,"gpt":0.4204414114669095,"spread":0.2983675486987428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002028659,0.001019816,0.00169308,0.001726455,0.0009777215,0.001438087,0.00263781,0.001829905,0.006128352],"category_scores_gemma":[0.00319735,0.001300654,0.001264679,0.001483506,0.000742005,0.00169691,0.001376968,0.001146416,0.0005042208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001886882,"about_ca_system_score_gemma":0.004434386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008013726,"about_ca_topic_score_gemma":0.008335254,"domain_scores_codex":[0.9991367,0.0003292138,0.00003598889,0.000121409,0.0001606208,0.0002159576],"domain_scores_gemma":[0.9982435,0.001252616,0.0001154077,0.00008681031,0.0001580979,0.0001435385],"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.0003826882,0.000454532,0.0003284234,0.0001457059,0.00003985235,0.00007128251,0.00009405837,0.934315,0.002534945,0.007050652,0.001216139,0.05336675],"study_design_scores_gemma":[0.0001433672,0.000135675,0.0001391406,0.00001022995,0.00001998393,0.00001749374,0.00002602973,0.9959803,0.000677311,0.002358884,0.0004764187,0.000015213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08463924,0.0002058382,0.9074316,0.0003784799,0.0001299023,0.0005865518,0.0001754192,0.0005269402,0.005926032],"genre_scores_gemma":[0.4834784,0.0001140694,0.5126871,0.0001523017,0.00003924008,0.000615972,0.0002525496,0.0001196406,0.002540738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008013726,"threshold_uncertainty_score":0.02050132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067880102","doi":"10.1002/jos.94","title":"Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times","year":2002,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University; McMaster University; Memorial University of Newfoundland","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Dominance (genetics); Algorithm; Flow shop scheduling; Scheduling (production processes); Branch and bound; Retard; Sequence (biology); Mathematics; Schedule","authors":[{"name":"Jinliang Cheng","is_ca":true},{"name":"George Steiner","is_ca":true},{"name":"Paul Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01849426096806984,"gpt":0.2333307052857025,"spread":0.2148364443176327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002946751,0.001734997,0.001328688,0.001065972,0.0009324601,0.001122318,0.001107197,0.001305841,0.001744578],"category_scores_gemma":[0.00488531,0.0009029386,0.0008651418,0.001130839,0.000962554,0.002227703,0.001259107,0.001618677,0.0004178091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008738209,"about_ca_system_score_gemma":0.002273295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0015965,"about_ca_topic_score_gemma":0.001749417,"domain_scores_codex":[0.9991952,0.0002866811,0.0000381068,0.00009988558,0.0002062484,0.0001738706],"domain_scores_gemma":[0.9977048,0.001634086,0.0002077308,0.0001096832,0.0002529179,0.00009072758],"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.0004087088,0.0002385924,0.0006137852,0.0002753596,0.00005515317,0.00008540246,0.0002418259,0.7920494,0.007824947,0.03456995,0.002831436,0.1608055],"study_design_scores_gemma":[0.0002556956,0.0001718797,0.0001706571,0.00001851758,0.00002335735,0.00005417711,0.00003059288,0.9611897,0.003262172,0.03341116,0.001395179,0.00001693461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05323182,0.0008310383,0.9428226,0.0002148132,0.00005729026,0.0001186312,0.0000609483,0.0004954077,0.002167364],"genre_scores_gemma":[0.243231,0.0009650369,0.751763,0.0001224323,0.0001045715,0.0004092344,0.000282415,0.0002658425,0.002856449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002946751,"threshold_uncertainty_score":0.01558411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978605753","doi":"10.1023/b:josh.0000031422.02125.97","title":"Predictive, Stochastic and Dynamic Extensions to Aversion Dynamics Scheduling","year":2004,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Risk aversion (psychology); Computer science; Heuristic; Loss aversion; Schedule; Scheduling (production processes); Operations research; Economics; Microeconomics; Expected utility hypothesis; Operations management; Mathematical economics; Mathematics; Artificial intelligence","authors":[{"name":"Gary W. Black","is_ca":false},{"name":"Kenneth N. McKay","is_ca":true},{"name":"Sherri L. Messimer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04847535851588778,"gpt":0.3939548206699781,"spread":0.3454794621540903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002642674,0.0008163066,0.001096204,0.0006974948,0.0007214778,0.001916632,0.001737445,0.001029473,0.004434292],"category_scores_gemma":[0.0117516,0.0005988725,0.0007180383,0.0009441615,0.001361679,0.00247383,0.00159082,0.00242409,0.0002719336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00185276,"about_ca_system_score_gemma":0.002478077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00694995,"about_ca_topic_score_gemma":0.006387864,"domain_scores_codex":[0.9991133,0.0003659614,0.00002930825,0.0001168252,0.000198776,0.0001758192],"domain_scores_gemma":[0.9950277,0.003236458,0.0004851613,0.0004317922,0.000492703,0.0003261247],"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.00008695431,0.00005144528,0.0002730551,0.00001973594,0.0000152054,0.00003640711,0.00004210261,0.8939599,0.0003125751,0.09617038,0.0007034926,0.008328713],"study_design_scores_gemma":[0.000006055206,0.00001131159,0.00004426635,0.000001835323,0.000003488033,0.000004041681,0.000003964082,0.9803591,0.00004785142,0.01936586,0.0001486064,0.000003648566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1393699,0.0004878539,0.8431922,0.001866785,0.0003206011,0.00006225104,0.0001982612,0.0003130492,0.01418913],"genre_scores_gemma":[0.9708694,0.0002879535,0.02191888,0.0001128254,0.000158573,0.00004900925,0.00008598094,0.00004484938,0.00647244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00694995,"threshold_uncertainty_score":0.01483417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073418197","doi":"10.1007/s10951-012-0277-x","title":"A branch and bound algorithm for the response time variability problem","year":2012,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and bound; Computer science; Mathematical optimization; Scheduling (production processes); Integer programming; Algorithm; Range (aeronautics); Linear programming; Upper and lower bounds; Branch and cut; Integer (computer science); Mathematics","authors":[{"name":"Alberto García‐Villoria","is_ca":false},{"name":"Albert Corominas Subias","is_ca":false},{"name":"Xavier Delorme","is_ca":false},{"name":"Alexandre Dolgui","is_ca":false},{"name":"Wiesław Kubiak","is_ca":true},{"name":"Rafael Pastor","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007735413333746032,"gpt":0.2306258595686345,"spread":0.2228904462348885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002532504,0.001754521,0.002754638,0.001684635,0.001254571,0.002250047,0.002448611,0.002596859,0.009658743],"category_scores_gemma":[0.007327345,0.001211554,0.001226831,0.002497358,0.001048146,0.002554684,0.002150118,0.004563375,0.001948872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001826607,"about_ca_system_score_gemma":0.00313968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00918505,"about_ca_topic_score_gemma":0.007263094,"domain_scores_codex":[0.9985058,0.0004413031,0.00006482089,0.0002623011,0.0004344033,0.0002914369],"domain_scores_gemma":[0.9952118,0.003873285,0.0001645934,0.0002036651,0.0003676555,0.0001790174],"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.0004035156,0.0002974098,0.0003986518,0.0001356024,0.00008464797,0.00005608582,0.00008114279,0.7773547,0.002153327,0.01983275,0.0073224,0.1918799],"study_design_scores_gemma":[0.00005748949,0.00002854392,0.00005439529,0.000007128281,0.00001032444,0.000008907896,0.00000693696,0.9908771,0.0002236803,0.008146931,0.00057249,0.000006014711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005627695,0.0004007947,0.9896516,0.0003071148,0.00007845259,0.000071559,0.00009166598,0.0008611617,0.002909881],"genre_scores_gemma":[0.1438412,0.0004229174,0.8491628,0.0002456838,0.0001726506,0.0004347262,0.0005424297,0.0005566178,0.004621107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009658743,"threshold_uncertainty_score":0.03231174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2607302740","doi":"10.1007/s10951-017-0518-0","title":"Scheduling shared continuous resources on many-cores","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Computer science; Job shop scheduling; Scheduling (production processes); Time complexity; Heuristic; Mathematical optimization; Job scheduler; Parallel computing; Shared resource; Distributed computing; Algorithm; Schedule; Mathematics; Computer network","authors":[{"name":"Ernst Althaus","is_ca":false},{"name":"André Brinkmann","is_ca":false},{"name":"Peter Kling","is_ca":true},{"name":"Friedhelm Meyer auf der Heide","is_ca":false},{"name":"Lars Nagel","is_ca":false},{"name":"Sören Riechers","is_ca":false},{"name":"Jiřı́ Sgall","is_ca":false},{"name":"Tim Süß","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01868528415120394,"gpt":0.2527342819635062,"spread":0.2340489978123022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131221,0.0005603955,0.0009524653,0.0003709092,0.0006852986,0.001171069,0.001614167,0.0005622467,0.003160859],"category_scores_gemma":[0.002954554,0.0004663586,0.0004014057,0.0007935226,0.0007067174,0.001083983,0.001341875,0.0008994014,0.0002005432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007258765,"about_ca_system_score_gemma":0.001345147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002765383,"about_ca_topic_score_gemma":0.006348206,"domain_scores_codex":[0.9994468,0.0001483398,0.00002857423,0.0000898268,0.0001003929,0.000185962],"domain_scores_gemma":[0.9982142,0.0009689534,0.0001225827,0.0002264215,0.0002129513,0.0002547874],"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.001862894,0.0003089149,0.002088707,0.0002267003,0.0001382237,0.0004515626,0.0001280671,0.9066783,0.01210765,0.01481756,0.003768687,0.05742284],"study_design_scores_gemma":[0.00006553417,0.0001036429,0.000240661,0.000004417164,0.00001209643,0.00002053953,0.00003196763,0.9938123,0.0008659434,0.004486375,0.0003513398,0.000005222998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6608298,0.00117655,0.3271576,0.0004727615,0.000609106,0.0001326083,0.0001176808,0.0005596487,0.00894424],"genre_scores_gemma":[0.9659452,0.00008916729,0.0323871,0.00005747396,0.00005902552,0.00004298948,0.00005517884,0.00004724253,0.001316627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003160859,"threshold_uncertainty_score":0.01057416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991396184","doi":"10.1007/s10951-009-0128-6","title":"Open-shop dense schedules: properties and worst-case performance ratio","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematical proof; Job shop scheduling; Open shop; Schedule; Heuristic; Computer science; Mathematical optimization; Mathematics; Construct (python library); Scheduling (production processes); Combinatorics; Discrete mathematics; Flow shop scheduling","authors":[{"name":"Rongjun Chen","is_ca":false},{"name":"Wanzhen Huang","is_ca":true},{"name":"Zhongxian Men","is_ca":true},{"name":"Guochun Tang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03315531448050888,"gpt":0.2392811098692687,"spread":0.2061257953887599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005212577,0.001216646,0.001858973,0.001388674,0.001095409,0.001885902,0.001864942,0.000734703,0.003274377],"category_scores_gemma":[0.02540322,0.0009429842,0.0006582619,0.002313836,0.001548196,0.003240935,0.001834201,0.001194735,0.0003368865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001618173,"about_ca_system_score_gemma":0.002656314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0018681,"about_ca_topic_score_gemma":0.002471009,"domain_scores_codex":[0.9972008,0.0008232863,0.0001532669,0.0003270412,0.0008977905,0.00059788],"domain_scores_gemma":[0.9702149,0.02162823,0.002655437,0.002225066,0.001898697,0.001377752],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003015551,0.0008790754,0.003917011,0.0005809095,0.0001585958,0.0003033438,0.0004758711,0.8281365,0.01452032,0.06651199,0.003591164,0.07790978],"study_design_scores_gemma":[0.0001473522,0.0007492536,0.001187762,0.00002466677,0.00007089441,0.0002357843,0.0001668591,0.926183,0.004821364,0.06564218,0.0007405503,0.0000302761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5315879,0.0009569544,0.4553704,0.0004189195,0.0000922142,0.0003451915,0.0007143343,0.001027055,0.009487099],"genre_scores_gemma":[0.9457377,0.0002718141,0.05214122,0.00005758792,0.00007502226,0.000145364,0.0003811824,0.0002016317,0.0009885468],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005212577,"threshold_uncertainty_score":0.02756709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1493797193","doi":"10.1023/a:1022952324290","title":"Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; York University","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing; Multiprocessor scheduling; Processor scheduling; Scheduling (production processes); Distributed computing; Fair-share scheduling; Rate-monotonic scheduling; Operating system; Mathematical optimization; Schedule; Mathematics","authors":[{"name":"Donald Chinn","is_ca":true},{"name":"Tim Brecht","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01129938630170956,"gpt":0.228047766069577,"spread":0.2167483797678675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002693672,0.0004209603,0.0007341855,0.000825831,0.002025307,0.001736299,0.001982243,0.0007380417,0.001108343],"category_scores_gemma":[0.01098446,0.0006415696,0.0003264585,0.001207244,0.0008466545,0.00155056,0.001064077,0.001001815,0.0001691333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001089024,"about_ca_system_score_gemma":0.002303634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00253686,"about_ca_topic_score_gemma":0.006946035,"domain_scores_codex":[0.998869,0.0002745201,0.00007594747,0.0002088244,0.0002722646,0.0002993846],"domain_scores_gemma":[0.9935364,0.003393153,0.0006149429,0.0008281277,0.0009273586,0.0006999289],"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.004754274,0.000708281,0.01828924,0.0001573642,0.0001472938,0.0007511339,0.0005479384,0.7998671,0.0462637,0.02349601,0.001910228,0.1031074],"study_design_scores_gemma":[0.00004440458,0.0002241979,0.001975111,0.000003346102,0.00001460344,0.00006155942,0.00005478048,0.9889619,0.004013859,0.004322144,0.0003116707,0.00001239811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9051641,0.0001952154,0.09148955,0.0002369826,0.0001594512,0.00008268362,0.00005801961,0.0001588835,0.002455109],"genre_scores_gemma":[0.984211,0.00004459311,0.01466461,0.00003607398,0.00003707223,0.0000288179,0.000069471,0.00003532746,0.0008729739],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002693672,"threshold_uncertainty_score":0.01424563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4395683568","doi":"10.1007/s10951-024-00808-x","title":"Short-term underground mine planning with uncertain activity durations using constraint programming","year":2024,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Term (time); Constraint (computer-aided design); Computer science; Operations research; Constraint programming; Mathematical optimization; Supply chain management; Supply chain; Business; Mathematics; Stochastic programming","authors":[{"name":"Younes Aalian","is_ca":true},{"name":"Michel Gamache","is_ca":true},{"name":"Gilles Pesant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05302174323847721,"gpt":0.300767802786175,"spread":0.2477460595476978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546683,0.0015478,0.002868739,0.001103709,0.0007403624,0.002762757,0.002756888,0.001788171,0.004296678],"category_scores_gemma":[0.005731035,0.002229806,0.001747489,0.003103372,0.001028517,0.002657757,0.001567563,0.001993374,0.0003128794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002267231,"about_ca_system_score_gemma":0.002857929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02907098,"about_ca_topic_score_gemma":0.02611466,"domain_scores_codex":[0.9984912,0.0004986611,0.00009866191,0.0003376949,0.0002766224,0.0002971622],"domain_scores_gemma":[0.9939417,0.004951666,0.00039238,0.0001179154,0.0003529394,0.0002433879],"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.00004092386,0.0000159577,0.0001303877,0.00003648097,0.0000259548,0.00004785055,0.00001213146,0.9943206,0.0001433784,0.002332474,0.000210296,0.002683627],"study_design_scores_gemma":[0.00000667286,0.00001496675,0.00005717938,0.000005426865,0.000007725491,0.000006566939,0.000007125103,0.9975659,0.00007618891,0.002117597,0.0001302264,0.000004481438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06792163,0.001003808,0.9230592,0.0006040556,0.0001427716,0.0001896271,0.001006457,0.0002530766,0.005819324],"genre_scores_gemma":[0.8348159,0.0008439944,0.1559643,0.0001399099,0.0001198426,0.0004739256,0.0009117025,0.0001895973,0.00654089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02907098,"threshold_uncertainty_score":0.05780351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010898123","doi":"10.1007/s10951-006-8596-4","title":"A case study of mutual routing-scheduling reformulation","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Japan Society for the Promotion of Science; University College Cork; University of Glasgow","keywords":"Computer science; Vehicle routing problem; Scheduling (production processes); Mathematical optimization; Software; Job shop scheduling; Key (lock); Combinatorial optimization; Operations research; Constraint programming; Industrial engineering; Routing (electronic design automation); Mathematics; Algorithm; Engineering","authors":[{"name":"J. Christopher Beck","is_ca":true},{"name":"Patrick Prosser","is_ca":false},{"name":"Evgeny Selensky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0248211093843664,"gpt":0.2835155563058206,"spread":0.2586944469214543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001659697,0.0003396613,0.0004561613,0.0003202237,0.001134668,0.001153753,0.001011551,0.001876661,0.006962367],"category_scores_gemma":[0.004155788,0.0001999292,0.0006856361,0.0006566147,0.0007173824,0.001109644,0.001001213,0.001023863,0.0003908532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001103136,"about_ca_system_score_gemma":0.001126118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006423889,"about_ca_topic_score_gemma":0.006057002,"domain_scores_codex":[0.999008,0.0005351701,0.00002083441,0.00008832337,0.0001836223,0.0001641072],"domain_scores_gemma":[0.9985889,0.0009278765,0.00009885118,0.0001949069,0.0001235831,0.0000659116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"case_report","study_design_scores_codex":[0.0002648304,0.0003973001,0.001392546,0.0001323254,0.00004266477,0.002186247,0.0004642921,0.6241788,0.002231471,0.3223432,0.006258501,0.04010781],"study_design_scores_gemma":[0.0001005018,0.0002160511,0.0005434607,0.0000152995,0.0000332731,0.0004978474,0.0004448484,0.9378781,0.003108832,0.04332945,0.01380961,0.00002276033],"study_design_candidate":"case_report","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.490271,0.0004433943,0.4057725,0.002893746,0.000146208,0.000341257,0.0003861589,0.0005400615,0.09920571],"genre_scores_gemma":[0.9167921,0.0001104488,0.07083666,0.00008651434,0.00003450036,0.00008259689,0.0001286761,0.00006237155,0.01186612],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006962367,"threshold_uncertainty_score":0.02329141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123331415","doi":"10.1007/s10951-014-0396-7","title":"Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs","year":2014,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Mathematical optimization; Computer science; Scheme (mathematics); Time complexity; Supply chain; Due date; Polynomial; Retard; Holding cost; Polynomial-time approximation scheme; Supply chain management; Mathematics; Job shop scheduling; Algorithm; Schedule; Business","authors":[{"name":"Sorina Dumitrescu","is_ca":true},{"name":"George Steiner","is_ca":true},{"name":"Rui Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01179867429822715,"gpt":0.2104790112736555,"spread":0.1986803369754283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00406147,0.00113295,0.002544196,0.001310979,0.001329941,0.002890756,0.001948091,0.001536176,0.003654346],"category_scores_gemma":[0.008354744,0.001345861,0.000682987,0.002135791,0.001078543,0.002266492,0.001083927,0.001033324,0.0002914676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003012799,"about_ca_system_score_gemma":0.003351838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006171998,"about_ca_topic_score_gemma":0.00574104,"domain_scores_codex":[0.9979789,0.0008768212,0.0001227162,0.0003153973,0.0003302704,0.0003758456],"domain_scores_gemma":[0.9962656,0.00207583,0.0004589605,0.0001374182,0.0007669848,0.0002952693],"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.0004764158,0.0001140014,0.0005958905,0.0001892398,0.0000577801,0.00007522073,0.0001346625,0.9571187,0.003147819,0.007143673,0.0007762393,0.0301703],"study_design_scores_gemma":[0.0000323967,0.000136691,0.0002548088,0.00001901389,0.00003639177,0.00001536441,0.00006163921,0.9915498,0.001113704,0.006413889,0.0003501003,0.00001605292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2030134,0.001694475,0.7859585,0.0009085686,0.000486479,0.0003130603,0.0001402796,0.0004394238,0.007045843],"genre_scores_gemma":[0.9503166,0.0002954311,0.04624965,0.0000684484,0.00008065631,0.00006031368,0.00003850112,0.00009342671,0.002797015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006171998,"threshold_uncertainty_score":0.02185941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126394800","doi":"10.1007/s10951-006-7041-z","title":"On the connection between a cyclic job shop and a reentrant flow shop scheduling problem","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Reentrancy; Flow shop scheduling; Job shop; Job shop scheduling; Computer science; Flow (mathematics); Mathematical optimization; Scheduling (production processes); Mathematics; Schedule; Operating system","authors":[{"name":"George Steiner","is_ca":true},{"name":"Zhihui Xue","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01274153345171136,"gpt":0.2172254222996539,"spread":0.2044838888479425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002115318,0.000507562,0.000833164,0.001386794,0.001326281,0.001501603,0.002072215,0.002143371,0.006567198],"category_scores_gemma":[0.01450354,0.0005342932,0.0009533187,0.002342083,0.002341273,0.005273574,0.001807898,0.002578752,0.0003454926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007893498,"about_ca_system_score_gemma":0.0008883292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002401557,"about_ca_topic_score_gemma":0.002160581,"domain_scores_codex":[0.9991717,0.0003721266,0.00004765288,0.0001659408,0.000153091,0.00008953671],"domain_scores_gemma":[0.9887387,0.009329434,0.000787845,0.0003114729,0.0004851629,0.0003475185],"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.0003323415,0.0001525105,0.001446653,0.0002868739,0.00004697531,0.0009770278,0.0005271861,0.1058248,0.001230296,0.8582834,0.004945562,0.02594644],"study_design_scores_gemma":[0.00004668244,0.00009000713,0.0007354991,0.00004385803,0.00002553443,0.0002208602,0.0001021392,0.3801389,0.0001838916,0.614469,0.003911947,0.0000316628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2586614,0.003095989,0.6771671,0.005653136,0.0006609999,0.0001719265,0.0004000927,0.0001565005,0.05403282],"genre_scores_gemma":[0.8384393,0.003317613,0.1429393,0.0008238314,0.001188417,0.0001555349,0.000511909,0.0001328502,0.01249111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006567198,"threshold_uncertainty_score":0.0219695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092058125","doi":"10.1007/s10951-009-0149-1","title":"On a reduction of the interval coloring problem to a series of bandwidth coloring problems","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"","keywords":"Fractional coloring; Combinatorics; Mathematics; Complete coloring; Edge coloring; Greedy coloring; Graph coloring; Vertex (graph theory); Interval (graph theory); Discrete mathematics; Integer (computer science); Graph; Brooks' theorem; Computer science; Graph power; Chordal graph; 1-planar graph","authors":[{"name":"Mathieu Bouchard","is_ca":true},{"name":"Mirjana Čangalović","is_ca":false},{"name":"Alain Hertz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07491560948366902,"gpt":0.3436436124589847,"spread":0.2687280029753156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001455448,0.001425058,0.001426598,0.00144989,0.001227486,0.002244938,0.002496212,0.001455662,0.007613464],"category_scores_gemma":[0.00648508,0.0006372887,0.003208187,0.002573206,0.001329081,0.002928325,0.002173624,0.004784736,0.0009045015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001363314,"about_ca_system_score_gemma":0.002073441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006298444,"about_ca_topic_score_gemma":0.005092993,"domain_scores_codex":[0.9988449,0.0003682812,0.00004802831,0.0001818711,0.0003789674,0.0001780232],"domain_scores_gemma":[0.9975314,0.001659837,0.0001328337,0.0002644633,0.0002590715,0.0001523504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001618034,0.0006466096,0.0005776169,0.0005097825,0.0001130294,0.0002332081,0.0004036559,0.3555772,0.002941067,0.4538736,0.03769477,0.1472677],"study_design_scores_gemma":[0.00005630541,0.00009550765,0.0003199971,0.0000586277,0.00006593872,0.0001551311,0.0001229949,0.5066944,0.00103043,0.4774263,0.01394567,0.00002867028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02175969,0.0009123849,0.9409348,0.001469792,0.0005683488,0.0002754056,0.0003746842,0.0003008514,0.03340412],"genre_scores_gemma":[0.2187641,0.003871448,0.7391484,0.001060271,0.001711902,0.0006272774,0.001931828,0.0006402596,0.03224456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007613464,"threshold_uncertainty_score":0.02546954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136004943","doi":"10.1007/s10951-009-0139-3","title":"Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki","keywords":"Job shop scheduling; Minification; Computer science; Time complexity; Scheduling (production processes); Schedule; Mathematical optimization; Running time; Single-machine scheduling; Algorithm; Mathematics","authors":[{"name":"Dariusz Dereniowski","is_ca":false},{"name":"Wiesław Kubiak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02240112904978402,"gpt":0.2536726972704223,"spread":0.2312715682206383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001222888,0.0008623834,0.001535157,0.0005964797,0.0008020657,0.0009005715,0.001336781,0.0004523835,0.001306624],"category_scores_gemma":[0.001774374,0.0005387864,0.000544433,0.001012673,0.0004978561,0.001009458,0.0005965929,0.0004957382,0.0001135503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008996877,"about_ca_system_score_gemma":0.0013312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00252761,"about_ca_topic_score_gemma":0.002847044,"domain_scores_codex":[0.9992792,0.0002502935,0.00003708022,0.0001208796,0.0001369604,0.0001755823],"domain_scores_gemma":[0.9989736,0.0004631745,0.0001591386,0.00008430445,0.0002070373,0.0001127856],"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.001044198,0.0001394735,0.0005936606,0.0002383067,0.00008288134,0.0001192159,0.00006813063,0.9463967,0.009341486,0.006014647,0.001294928,0.03466643],"study_design_scores_gemma":[0.00002070195,0.0001568868,0.0003877046,0.000003730003,0.00001810466,0.00002435148,0.00001542525,0.994231,0.001579629,0.003308589,0.0002470329,0.000006834672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.380926,0.001118383,0.6085971,0.0004330612,0.0002569098,0.0001808099,0.0002183037,0.0004977224,0.007771743],"genre_scores_gemma":[0.9435706,0.0002023168,0.05426776,0.00003836145,0.00006226986,0.00006732226,0.00009651215,0.00008467941,0.001610067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00252761,"threshold_uncertainty_score":0.006527722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007684460","doi":"10.1007/s10951-013-0341-1","title":"Scheduling semi-malleable jobs to minimize mean flow time","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Schedule; Mathematical optimization; Job shop scheduling; Dynamic programming; Flow shop scheduling; Set (abstract data type); Parallel computing; Algorithm; Mathematics; Operating system; Programming language","authors":[{"name":"Yann Hendel","is_ca":true},{"name":"Wiesław Kubiak","is_ca":true},{"name":"Denis Trystram","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009737137138782662,"gpt":0.2106612866603317,"spread":0.200924149521549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001324007,0.0006924414,0.0009621433,0.0007693644,0.0008125873,0.001058636,0.001325221,0.0009096178,0.002342611],"category_scores_gemma":[0.003010974,0.000618921,0.0005984509,0.0007402766,0.0009129351,0.001087081,0.001050089,0.0008324344,0.0003212892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008535189,"about_ca_system_score_gemma":0.001715529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001780985,"about_ca_topic_score_gemma":0.002931418,"domain_scores_codex":[0.9995463,0.0001233078,0.0000338942,0.00006910421,0.0000916992,0.0001356198],"domain_scores_gemma":[0.9981359,0.00103103,0.0002168874,0.000146468,0.0002220187,0.0002475714],"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.002996872,0.0004001082,0.00132447,0.0002887858,0.00009697108,0.0002140306,0.0001753807,0.9019327,0.03491993,0.007936582,0.001470728,0.04824349],"study_design_scores_gemma":[0.00005844571,0.0002894268,0.0002244756,0.000006984807,0.00001182429,0.00002546068,0.00003106896,0.9915649,0.003701281,0.003854189,0.0002212472,0.00001068918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4831512,0.0003479112,0.512407,0.0002822098,0.0002002397,0.0002214989,0.0001176603,0.0008952905,0.002376979],"genre_scores_gemma":[0.9005514,0.00007249906,0.09702132,0.00006188932,0.00005003239,0.00008113387,0.0000722991,0.0001058037,0.001983583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002342611,"threshold_uncertainty_score":0.007836819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000464179","doi":"10.1007/s10951-019-00633-7","title":"Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments","year":2020,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multiprocessing; Computer science; Open shop; Scheduling (production processes); Job shop scheduling; Approximation algorithm; Flow shop scheduling; Multiprocessor scheduling; Algorithm; Mathematical optimization; Parallel computing; Flow (mathematics); Mathematics; Routing (electronic design automation)","authors":[{"name":"Jianming Dong","is_ca":false},{"name":"Joshua Chang","is_ca":true},{"name":"Bing Su","is_ca":false},{"name":"Jueliang Hu","is_ca":false},{"name":"Guohui Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04372960983289673,"gpt":0.3190339961306103,"spread":0.2753043862977136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01283925,0.001364103,0.002135154,0.001173381,0.001201746,0.001427651,0.003939535,0.002908079,0.003999194],"category_scores_gemma":[0.03340796,0.001528452,0.00174041,0.00193787,0.001713749,0.004969502,0.001426347,0.003148639,0.0003764112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003136082,"about_ca_system_score_gemma":0.003231372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01371333,"about_ca_topic_score_gemma":0.009089305,"domain_scores_codex":[0.9953288,0.003015312,0.0002227412,0.0004474558,0.0004854377,0.0005003483],"domain_scores_gemma":[0.8857548,0.100724,0.002427343,0.005910451,0.003730648,0.001452891],"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.002850364,0.001820469,0.003181115,0.0002467539,0.00008516746,0.00003347356,0.00008989174,0.9738488,0.0007173499,0.003807928,0.0008547508,0.01246393],"study_design_scores_gemma":[0.000165575,0.0002338079,0.0004490814,0.00000649051,0.00002127614,0.000007749853,0.00002820685,0.9974903,0.0003416018,0.001181153,0.0000641899,0.00001049957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8745717,0.00080969,0.1184457,0.0003604738,0.0001052888,0.0003486382,0.0006448757,0.0005525348,0.004161139],"genre_scores_gemma":[0.9189747,0.000156165,0.07859866,0.00005736969,0.00002684692,0.0002498484,0.0008197897,0.00007154612,0.00104496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01371333,"threshold_uncertainty_score":0.06790131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}