{"id":"W3041213598","doi":"10.1016/j.tcs.2019.12.009","title":"Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst France","keywords":"Job shop scheduling; Combinatorics; Approximation algorithm; Bounded function; Mathematics; Intersection (aeronautics); Discrete mathematics; Conjecture; Minification; Algorithm; Computer science; Schedule; 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.0001225828,0.0001346261,0.00011383,0.0001015936,0.000119077,0.0001733573,0.0001586737,0.00005397111,0.0001057279],"category_scores_gemma":[0.00001182404,0.0001006071,0.00001285264,0.0003366778,0.0003211891,0.00015688,0.00003904801,0.0001407431,0.00001575165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004485556,"about_ca_system_score_gemma":0.00001312171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001802003,"about_ca_topic_score_gemma":8.452004e-7,"domain_scores_codex":[0.9991091,0.00002719159,0.0001194558,0.0002700304,0.0002666746,0.0002075756],"domain_scores_gemma":[0.9996046,0.00004880628,0.00002127822,0.0001772307,0.00004880688,0.00009926096],"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.00006738619,0.00001631869,0.003225116,0.00001963346,0.00002052063,0.000002914415,0.0004177573,0.8602393,0.0006150338,0.1278151,0.00001830097,0.007542652],"study_design_scores_gemma":[0.0004361765,0.0001736088,0.005497274,0.00002653719,0.000006447082,0.00001377221,0.000009640711,0.9878339,0.0007873288,0.005063816,0.000005944298,0.0001455591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5478923,0.000004591067,0.4510262,0.00004103449,0.0002485029,0.00009292502,0.000001737786,0.0001254813,0.0005671855],"genre_scores_gemma":[0.9188509,0.000001996676,0.08097493,0.00009867978,0.00003842181,0.000001452524,0.000005602995,0.00001368167,0.00001436215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3709586,"threshold_uncertainty_score":0.4102637,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004419485381486819,"score_gpt":0.2078514352725733,"score_spread":0.2034319498910865,"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."}}