{"id":"W1505364470","doi":"10.1016/j.cor.2004.08.004","title":"Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Variation (astronomy); Mathematical optimization; Product (mathematics); Minimax; Mathematics; Linear bottleneck assignment problem; Generalized assignment problem; Computer science; Assignment problem; Mathematical economics; Weapon target assignment problem","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157416,0.0002004663,0.0001669553,0.0002492475,0.0008687772,0.0005669157,0.0004446242,0.00007332106,0.00005674963],"category_scores_gemma":[0.0001445063,0.000166138,0.00004548418,0.0007607063,0.00006143968,0.0005618571,0.000157855,0.0005819753,0.0003377693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004924054,"about_ca_system_score_gemma":0.0002225298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006634624,"about_ca_topic_score_gemma":0.000126416,"domain_scores_codex":[0.9976838,0.0004342943,0.0003691354,0.0003948204,0.0005668673,0.0005511388],"domain_scores_gemma":[0.9986618,0.0002215831,0.00002339473,0.0005464949,0.0004445701,0.0001022055],"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.000004624568,0.00005521405,0.00002600955,0.00003557509,0.00003937363,0.000001474833,0.002074291,0.9637348,0.008989297,0.001698008,0.01263825,0.01070307],"study_design_scores_gemma":[0.0002942696,0.00006606745,0.000598337,0.00006985468,0.000009545399,0.00001003302,0.00008253667,0.9801699,0.003528265,0.00009507965,0.01487705,0.0001990963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03961511,0.0005958664,0.9303202,0.01865762,0.0004803088,0.003542914,0.00000815805,0.0007065983,0.006073211],"genre_scores_gemma":[0.853102,0.0001065605,0.1438354,0.0001147542,0.0007670386,0.000487084,0.00006547564,0.00006995982,0.0014518],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8134869,"threshold_uncertainty_score":0.6774911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0234626646086976,"score_gpt":0.2963393697940671,"score_spread":0.2728767051853694,"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."}}