{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228323,0.0009908491,0.001412556,0.0007609654,0.00106519,0.001206876,0.001889835,0.0007016135,0.001702611],"category_scores_gemma":[0.003552887,0.0008118462,0.0006927678,0.001798795,0.0007950171,0.001579171,0.001068464,0.0007684485,0.0001917285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127736,"about_ca_system_score_gemma":0.001437628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002203708,"about_ca_topic_score_gemma":0.002522059,"domain_scores_codex":[0.9989322,0.0003619764,0.00004220239,0.0002060398,0.0001840658,0.000273517],"domain_scores_gemma":[0.9978026,0.00136038,0.0002520306,0.0001980805,0.0001711966,0.0002157279],"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.0008967863,0.0002165084,0.0005281068,0.0002448133,0.00006380085,0.0001645357,0.00008294421,0.9560314,0.008261485,0.013049,0.001206079,0.01925455],"study_design_scores_gemma":[0.00002652965,0.0001147179,0.0004144375,0.000005699445,0.00001554872,0.00002347256,0.00001976333,0.9865888,0.001684993,0.0109348,0.0001643704,0.000006916238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5259472,0.0005282582,0.4634554,0.0003449982,0.0000881567,0.000191724,0.0003274482,0.0006998006,0.008417035],"genre_scores_gemma":[0.9143556,0.0001815999,0.0826826,0.00004907339,0.00006263086,0.0001181311,0.0002226664,0.0001674086,0.002160279],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002203708,"threshold_uncertainty_score":0.008182347,"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."}}