{"id":"W4242958581","doi":"10.1504/ijpom.2018.090372","title":"A path relinking-based scatter search for the resource-constrained project scheduling problem","year":2018,"lang":"en","type":"article","venue":"International Journal of Project Organisation and Management","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Polytechnique Montréal; SNC-Lavalin (Canada)","funders":"","keywords":"Metaheuristic; Computer science; Critical path method; Benchmark (surveying); Mathematical optimization; Scheduling (production processes); Tabu search; Project management; Path (computing); Job shop scheduling; Schedule; Algorithm; Mathematics; Systems engineering; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.007722457,0.0002168373,0.0002665005,0.00110344,0.0003687614,0.0009690935,0.001304714,0.00008140366,0.0001392818],"category_scores_gemma":[0.0009820586,0.0001360364,0.0001961632,0.0005511142,0.0003498352,0.0003439265,0.0002394946,0.0002650721,0.00002212729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001431568,"about_ca_system_score_gemma":0.0004197564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000253974,"about_ca_topic_score_gemma":0.00001356371,"domain_scores_codex":[0.9956439,0.0002618581,0.00119918,0.0004266312,0.002160226,0.0003082465],"domain_scores_gemma":[0.9957169,0.001412542,0.0008264183,0.0003218019,0.001653655,0.00006873981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.004548497,0.0007902779,0.01367041,0.0003131393,0.002724088,0.0001774893,0.04086175,0.00434019,0.00673099,0.044083,0.03025917,0.851501],"study_design_scores_gemma":[0.01850914,0.003382183,0.006196648,0.001442345,0.0006595114,0.0009995184,0.07808401,0.1897425,0.01835255,0.0165796,0.6644565,0.001595527],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.132432,0.00018211,0.824351,0.02972426,0.001420981,0.003567068,0.00004063298,0.00008696218,0.008195058],"genre_scores_gemma":[0.8910307,0.00005479813,0.1052567,0.002067729,0.001090838,0.00004871608,0.000007785168,0.00003341932,0.0004093169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8499055,"threshold_uncertainty_score":0.9344991,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09024689563341826,"score_gpt":0.3932375767276911,"score_spread":0.3029906810942728,"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."}}