{"id":"W3021772469","doi":"10.1016/j.tcs.2020.03.013","title":"Makespan minimization on unrelated parallel machines with a few bags","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Minification; Combinatorics; Approximation algorithm; Time complexity; Mathematics; Schedule; Polynomial-time approximation scheme; Scheduling (production processes); Computer science; Polynomial; Algorithm; Discrete mathematics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"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.001377525,0.001136151,0.001873287,0.0007375831,0.00115938,0.00129515,0.002080973,0.001002417,0.002530252],"category_scores_gemma":[0.003728444,0.001116434,0.0009284517,0.001864231,0.000762643,0.001804399,0.001193987,0.001145757,0.0003851437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001043989,"about_ca_system_score_gemma":0.00111965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002878308,"about_ca_topic_score_gemma":0.002774257,"domain_scores_codex":[0.9990405,0.0003125077,0.00004217056,0.0002365356,0.0001276167,0.0002406082],"domain_scores_gemma":[0.9979954,0.001156507,0.0001977563,0.0002202221,0.0001634782,0.0002667627],"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.001040458,0.0002865591,0.0007501491,0.0003518072,0.0001182881,0.0002451232,0.0001187054,0.9350669,0.008549754,0.01321286,0.002919161,0.03734025],"study_design_scores_gemma":[0.00003085443,0.0001702129,0.0005297723,0.00001120669,0.00002657648,0.00005114154,0.00003189901,0.980481,0.00159583,0.01657114,0.0004906339,0.000009659349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3345292,0.000747773,0.6514035,0.0007875538,0.0001935594,0.000264322,0.0004039484,0.0007826463,0.01088749],"genre_scores_gemma":[0.786886,0.000325121,0.2048931,0.0001905773,0.0001651832,0.00023379,0.0004037704,0.0004062075,0.006496296],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002878308,"threshold_uncertainty_score":0.008464515,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008816355427615812,"score_gpt":0.2082529349930051,"score_spread":0.1994365795653893,"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."}}