{"id":"W1985890716","doi":"10.1016/j.dam.2013.08.037","title":"A pseudo-polynomial time algorithm for solving the resource dependent assignment problem","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Generalized assignment problem; Function (biology); Assignment problem; Task (project management); Time complexity; Mathematical optimization; Mathematics; Weapon target assignment problem; Set (abstract data type); Resource allocation; Polynomial; Polynomial-time approximation scheme; Resource (disambiguation); Algorithm; Computer science","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.0002664952,0.0002328284,0.0002329751,0.00004445512,0.0001739073,0.0001871868,0.0002872449,0.00009860779,0.0001508646],"category_scores_gemma":[0.00001475997,0.0001689131,0.00008152294,0.0001021381,0.00003910639,0.00006460895,0.00005892649,0.0001553471,0.0002956195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006475798,"about_ca_system_score_gemma":0.00001413275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000218852,"about_ca_topic_score_gemma":3.316803e-7,"domain_scores_codex":[0.9988083,0.000006030688,0.0003721586,0.0001927748,0.0002548155,0.0003658964],"domain_scores_gemma":[0.9992462,0.0001937163,0.00008079703,0.0003506094,0.00003640024,0.00009221952],"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.00002064969,0.0004035562,0.000003636177,0.001135843,0.001007944,0.000004080604,0.01653913,0.5166635,0.03725773,0.01382094,0.08704481,0.3260982],"study_design_scores_gemma":[0.0004315782,0.00001567729,0.000001341193,0.00002855867,0.00004657833,0.000004930606,0.0008701652,0.9919667,0.003596103,0.001804548,0.000981298,0.0002525836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001002191,0.00005019438,0.9822322,0.0001588407,0.0000839347,0.001504943,0.00002121498,0.0004207157,0.01452575],"genre_scores_gemma":[0.00928485,0.000008520738,0.9881332,0.0001060603,0.0002368205,0.001165216,0.00004377592,0.0001111001,0.000910437],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4753031,"threshold_uncertainty_score":0.6888078,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007609167916331044,"score_gpt":0.2017024424673496,"score_spread":0.1940932745510185,"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."}}