{"id":"W1966508610","doi":"10.1007/s00453-004-1083-4","title":"Minimizing Makespan in Batch Machine Scheduling","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Job shop scheduling; Scheduling (production processes); Binary logarithm; Algorithm; Computer science; Running time; Combinatorics; Approximation algorithm; Batch processing; Time complexity; Mathematics; Discrete mathematics; Mathematical optimization; Schedule","routes":{"ca_aff":true,"ca_fund":false,"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.002656759,0.001444985,0.001640389,0.0009203386,0.001016167,0.001331492,0.001750204,0.00102532,0.001859089],"category_scores_gemma":[0.00717429,0.001016258,0.0007010504,0.00187948,0.001042249,0.002542051,0.001097169,0.001340187,0.0002221482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001232191,"about_ca_system_score_gemma":0.001520543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003632199,"about_ca_topic_score_gemma":0.003656261,"domain_scores_codex":[0.9986531,0.0005209561,0.00005449252,0.0001840382,0.0003684821,0.0002188898],"domain_scores_gemma":[0.9975798,0.001712434,0.0002280112,0.0001490845,0.0001899269,0.0001408492],"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.000435716,0.0001023666,0.000713015,0.0002088841,0.00007729912,0.00007516392,0.0001069881,0.9235751,0.002492648,0.02408584,0.002685138,0.04544193],"study_design_scores_gemma":[0.00002391685,0.00007591111,0.0003360705,0.00000815471,0.00002632521,0.00002303183,0.00001907347,0.9600277,0.001035737,0.03785071,0.000565544,0.000007789601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08083421,0.001172354,0.9114844,0.0005990297,0.0002417798,0.0001018564,0.0001348094,0.0004022041,0.005029321],"genre_scores_gemma":[0.7726392,0.001177024,0.2176086,0.0001495056,0.0003227904,0.0002637849,0.0002666623,0.0004413261,0.007131049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003632199,"threshold_uncertainty_score":0.01405042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008698031878053774,"score_gpt":0.215052947813895,"score_spread":0.2063549159358412,"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."}}