{"id":"W2805714452","doi":"10.1007/978-3-319-93031-2_23","title":"Horizontally Elastic Not-First/Not-Last Filtering Algorithm for Cumulative Resource Constraint","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Algorithm; Constraint programming; Scheduling (production processes); Constraint (computer-aided design); Mathematical optimization; Resource constraints; Computation; Set (abstract data type); Theoretical computer science; Mathematics; Distributed computing; Stochastic programming","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","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006138617,0.001074646,0.001373375,0.002045277,0.0008876916,0.001693278,0.004624467,0.0007054075,0.0003873355],"category_scores_gemma":[0.004379728,0.0008972284,0.0005111111,0.00106212,0.004230703,0.0005768798,0.001704257,0.00126172,0.000201664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005323325,"about_ca_system_score_gemma":0.000981958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001933386,"about_ca_topic_score_gemma":0.0001745045,"domain_scores_codex":[0.9894575,0.0001212626,0.001932025,0.00337396,0.003691187,0.001424035],"domain_scores_gemma":[0.9845472,0.01084277,0.001157674,0.001891241,0.001121038,0.0004400517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007587154,0.00002426024,0.00002250091,0.00002787865,0.00004059982,0.00008802594,0.002827074,0.03066962,0.0003657388,0.001135387,0.0001235353,0.9645995],"study_design_scores_gemma":[0.00117476,0.001060123,0.00009738692,0.001069737,0.00004631891,0.0003213766,0.00002234171,0.8920923,0.003667177,0.07658914,0.02215099,0.001708334],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009065554,0.00007564791,0.9899662,0.0006345416,0.001934099,0.00132408,0.0002074717,0.0001567877,0.004794667],"genre_scores_gemma":[0.1220365,0.000007421191,0.8721583,0.001708725,0.002658638,0.00005275459,0.00002671335,0.0001433044,0.001207541],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9628912,"threshold_uncertainty_score":0.9993479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06981872775659288,"score_gpt":0.3314531585137394,"score_spread":0.2616344307571465,"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."}}