{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002554,0.001279903,0.00110872,0.0009213906,0.001117243,0.001742238,0.002429144,0.001846135,0.01217145],"category_scores_gemma":[0.004581639,0.000641557,0.0009023121,0.001973144,0.0008577781,0.001921619,0.001855169,0.002460445,0.003324717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001449449,"about_ca_system_score_gemma":0.004344217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004982984,"about_ca_topic_score_gemma":0.00710739,"domain_scores_codex":[0.9989253,0.0002584561,0.00005178842,0.000245586,0.0003458548,0.0001730783],"domain_scores_gemma":[0.9983348,0.0009672653,0.00008689918,0.0002642748,0.0002439219,0.0001028685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007905483,0.0007170731,0.0005225143,0.0004971937,0.00007951804,0.0001632837,0.0001481352,0.3002712,0.009629561,0.08203965,0.03231774,0.5728235],"study_design_scores_gemma":[0.0003929849,0.0001252302,0.0002060425,0.00002262728,0.00002815556,0.0001296237,0.0000457572,0.9343269,0.002537792,0.05447149,0.007687465,0.00002579064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005282311,0.0001934506,0.9860045,0.000402412,0.0001560521,0.0001655235,0.000197041,0.001843363,0.005755447],"genre_scores_gemma":[0.06757574,0.0001609042,0.9267237,0.0002036434,0.00007728833,0.000304915,0.0004520131,0.0002425832,0.004259179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01217145,"threshold_uncertainty_score":0.04071754,"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."}}