{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001176872,0.000124546,0.0001118408,0.00005885404,0.0001079136,0.0001126915,0.0002911061,0.00003563194,0.0000828032],"category_scores_gemma":[0.00003428176,0.00009274607,0.00001831822,0.0007443061,0.0004562199,0.0001009796,0.00003998376,0.0001397718,0.00007618079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001705099,"about_ca_system_score_gemma":0.00001886621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.204008e-7,"about_ca_topic_score_gemma":8.80457e-8,"domain_scores_codex":[0.9991037,0.00002194731,0.0001222932,0.0002531083,0.0002817231,0.0002172516],"domain_scores_gemma":[0.9995191,0.00005833165,0.00001477395,0.0001512741,0.00005688065,0.0001996618],"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.00002363984,0.00001135951,0.00003791665,0.000007098707,0.00000483193,0.000005830902,0.0003627573,0.857564,0.00003348854,0.1358723,0.00003616612,0.006040604],"study_design_scores_gemma":[0.0002751614,0.0001648503,0.0002040375,0.00002166204,0.000005199495,0.000005727459,0.000005760334,0.9980036,0.0003711787,0.0007740984,0.00002652948,0.0001421749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02467228,0.00001254139,0.970906,0.001174942,0.0001472622,0.00008770936,0.00000132564,0.00047736,0.002520559],"genre_scores_gemma":[0.739626,0.00000316363,0.2596284,0.0006465947,0.00007389828,0.00000229959,0.000002900199,0.00001312805,0.000003606684],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7149538,"threshold_uncertainty_score":0.3782075,"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."}}