{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001546328,0.0002003965,0.0002115961,0.0002115973,0.00005580914,0.00005037884,0.0001820217,0.0001204349,0.00006400955],"category_scores_gemma":[0.00003730551,0.0002198346,0.00005723957,0.0004835022,0.00002714584,0.0001394613,0.00002803955,0.0003105688,0.0001327643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000135772,"about_ca_system_score_gemma":0.00003008573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000606156,"about_ca_topic_score_gemma":0.00002973963,"domain_scores_codex":[0.9988888,0.00001449295,0.000309908,0.0002357762,0.0001700804,0.000380939],"domain_scores_gemma":[0.999572,0.00003738673,0.00002474318,0.0002269332,0.00002988727,0.0001090068],"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.000004941883,0.0000371833,0.0001808888,0.00002056602,0.00002038002,0.00003822844,0.0004017404,0.9770249,0.0003338001,0.0003230688,0.00001406261,0.02160027],"study_design_scores_gemma":[0.001606678,0.00002948308,0.0003974402,0.00009657933,0.00001172046,0.00003317364,0.0002398451,0.9892341,0.00665294,0.0007788868,0.0004897073,0.0004294593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2494951,0.002321876,0.7359051,0.001172606,0.001758032,0.000389243,0.00002420901,0.001779893,0.007154021],"genre_scores_gemma":[0.5351177,0.00006339009,0.4644044,0.0001078448,0.0001589288,0.00001714322,0.00002269199,0.00005683193,0.00005104945],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2856226,"threshold_uncertainty_score":0.8964593,"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."}}