{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001864368,0.001016715,0.001412264,0.0006643416,0.0004867922,0.001718749,0.001718137,0.001639441,0.006354619],"category_scores_gemma":[0.00377979,0.0007259114,0.0006828516,0.001076813,0.0006024058,0.001693128,0.001104411,0.001327968,0.0005852308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007949201,"about_ca_system_score_gemma":0.001537107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003871355,"about_ca_topic_score_gemma":0.002877769,"domain_scores_codex":[0.9991924,0.0003646586,0.00002226278,0.000185803,0.0001012181,0.0001335719],"domain_scores_gemma":[0.9990682,0.0006128321,0.00009354368,0.00005932172,0.00009613332,0.00007012529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001941697,0.00009672901,0.0004002161,0.000223895,0.00004558626,0.00008582212,0.00005960631,0.9283924,0.002137064,0.02390395,0.00380003,0.04066053],"study_design_scores_gemma":[0.00001913728,0.00005623,0.0001506773,0.000008273843,0.00001037434,0.00002848128,0.00002093781,0.9851449,0.0006101131,0.0127534,0.001190468,0.000006990316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06153194,0.0005627855,0.9251887,0.0005929493,0.0001045854,0.00009259458,0.0002150693,0.0003804413,0.01133099],"genre_scores_gemma":[0.7308335,0.0006487097,0.2498585,0.0002259647,0.0001909915,0.0002447004,0.0005449643,0.0004008983,0.01705182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006354619,"threshold_uncertainty_score":0.02125835,"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."}}