{"id":"W2046023406","doi":"10.1016/j.advengsoft.2010.05.010","title":"A hybrid scatter search approach for resource-constrained project scheduling problem in PERT-type networks","year":2010,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Metaheuristic; Job shop scheduling; Mathematical optimization; Computer science; Crossover; Scheduling (production processes); Critical path method; Local search (optimization); Benchmark (surveying); Algorithm; Mathematics; Artificial intelligence; Engineering; Schedule","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004719715,0.0004842234,0.0007043146,0.001330691,0.0001464306,0.0003222822,0.001371054,0.0002641987,0.00003939976],"category_scores_gemma":[0.006998823,0.0004320382,0.0001904966,0.002104587,0.0002205713,0.0008687263,0.0002315187,0.00158371,0.000009153653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000105188,"about_ca_system_score_gemma":0.0002336178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002253497,"about_ca_topic_score_gemma":0.00003180675,"domain_scores_codex":[0.9951837,0.0001293514,0.001218569,0.001284049,0.0009494355,0.001234918],"domain_scores_gemma":[0.9955403,0.002949935,0.0001943482,0.0008733162,0.0002759367,0.0001661538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001031477,0.00007204003,0.02203342,0.0001266647,0.00001140059,0.00002109758,0.0007937956,0.9067589,0.000498325,0.0002895836,0.00002595594,0.06926565],"study_design_scores_gemma":[0.001485762,0.0001215193,0.000712004,0.0002357394,0.000009425165,0.0001190789,0.0008999451,0.9852714,0.0004483989,0.0007685466,0.009157256,0.0007709333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.213995,0.001062825,0.7814372,0.0001115392,0.0004970863,0.001882334,0.00002303217,0.0003218248,0.0006691322],"genre_scores_gemma":[0.5038078,0.00002081723,0.4954807,0.0000593072,0.0002336576,0.0002349055,0.00002921118,0.00006661758,0.00006694726],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2898128,"threshold_uncertainty_score":0.9998131,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03298794965464718,"score_gpt":0.3305595728414295,"score_spread":0.2975716231867823,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}