{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355316,0.0008011658,0.001050232,0.001226815,0.0004960156,0.0006066154,0.0009469147,0.001244452,0.002427003],"category_scores_gemma":[0.002114431,0.0004415029,0.0009402847,0.001526964,0.0005779419,0.00081842,0.0009425581,0.0008880833,0.0002868916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005531049,"about_ca_system_score_gemma":0.00164052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005317655,"about_ca_topic_score_gemma":0.004741897,"domain_scores_codex":[0.9996759,0.0001445312,0.00001258693,0.00004763411,0.00008199794,0.00003736776],"domain_scores_gemma":[0.9993655,0.0003860313,0.0000619708,0.00003505086,0.0001070459,0.0000443294],"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.00005376112,0.00004995108,0.0005160356,0.00006311187,0.00003357451,0.0000380628,0.0000383554,0.9640775,0.001251575,0.004505952,0.000623946,0.02874821],"study_design_scores_gemma":[0.00002156345,0.00005659506,0.0001028383,0.000009817973,0.000009162403,0.000017729,0.00001287562,0.9973494,0.0002244125,0.001723103,0.0004682488,0.000004170299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05746839,0.0004173781,0.9383332,0.0001879561,0.00004255949,0.0001234698,0.00008798647,0.0002597986,0.003079202],"genre_scores_gemma":[0.44373,0.0005026713,0.5507752,0.000118529,0.00004157128,0.0005333024,0.0004163192,0.0001264406,0.003755903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005317655,"threshold_uncertainty_score":0.01057339,"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."}}