{"id":"W3125454972","doi":"10.14488/bjopm.2021.007","title":"A Multi-Objective Scheduling Algorithm for Multi-Mode Resource Constrained Projects in the Presence of Uncertain Resource Availability","year":2021,"lang":"en","type":"article","venue":"Brazilian Journal of Operations & Production Management","topic":"BIM and Construction Integration","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Fair-share scheduling; Dynamic priority scheduling; Genetic algorithm scheduling; Mathematical optimization; Job shop scheduling; Heuristic; Rate-monotonic scheduling; Operations research; Industrial engineering; Engineering; Mathematics; Artificial intelligence","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.001009005,0.0001486928,0.0002109797,0.0002389004,0.0001657216,0.00008131972,0.0001932211,0.00005655265,0.00001961973],"category_scores_gemma":[0.000308611,0.0001241089,0.0001091038,0.0005996766,0.0001191186,0.0003341982,0.00002161493,0.0002671922,0.000001319652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001263565,"about_ca_system_score_gemma":0.0001071153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009440007,"about_ca_topic_score_gemma":0.0001306571,"domain_scores_codex":[0.9983948,0.000222642,0.0007039841,0.0002458779,0.0002636483,0.000169042],"domain_scores_gemma":[0.9989488,0.000056261,0.0001314007,0.0003033637,0.0005226779,0.00003751573],"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.00007734068,0.0005505106,0.0004415438,0.0003210141,0.0002910352,0.00002136933,0.008261453,0.8141984,0.009802224,0.001907379,0.00147219,0.1626555],"study_design_scores_gemma":[0.002831324,0.0001790819,0.003803152,0.0004577822,0.0001680429,0.0003534566,0.05660706,0.8985386,0.02539049,0.0001734843,0.01112357,0.0003739329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09711819,0.0008194371,0.8964449,0.001943139,0.0008913646,0.002047408,0.00003532137,0.00006095386,0.0006392617],"genre_scores_gemma":[0.4797801,0.00007604736,0.5190157,0.00006113831,0.0002335406,0.0001466095,0.00002223864,0.00002214897,0.000642437],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.382662,"threshold_uncertainty_score":0.5061013,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02728986193083059,"score_gpt":0.2833625452469981,"score_spread":0.2560726833161674,"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."}}