{"id":"W2056881568","doi":"10.1007/s10951-007-0025-9","title":"Single machine batch scheduling to minimize total completion time and resource consumption costs","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Job scheduler; Partition (number theory); Scheduling (production processes); Job queue; Batch processing; Job shop scheduling; Non-renewable resource; Resource consumption; Batch production; Time complexity; Mathematical optimization; Operations research; Operations management; Algorithm; Schedule; Mathematics; Economics; Engineering; Operating system","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.001238871,0.0002032616,0.0003437109,0.0003766118,0.0001173453,0.0001159057,0.0001245635,0.0001303343,0.0000707687],"category_scores_gemma":[0.0002496975,0.0002074936,0.00008372862,0.0002708341,0.00003773736,0.000232481,0.00003731233,0.0004054421,0.00004657306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001873787,"about_ca_system_score_gemma":0.00001695219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003309156,"about_ca_topic_score_gemma":0.000001959977,"domain_scores_codex":[0.9984103,0.00003589872,0.0007083592,0.000160597,0.0003644105,0.0003204343],"domain_scores_gemma":[0.998928,0.0002298415,0.0001870874,0.0001245507,0.0002023588,0.0003282266],"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.0001893087,0.00007276585,0.002285578,0.00005409163,0.00009446983,0.00004583076,0.0005710658,0.9012276,0.07491076,0.00003207526,0.00005911578,0.02045733],"study_design_scores_gemma":[0.002065369,0.0002153319,0.00656148,0.0005858946,0.00009301427,0.0008368551,0.0004891668,0.9701576,0.01789315,0.00001866526,0.0005656235,0.0005178573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6729093,0.0009865984,0.3252087,0.0001578034,0.0003203622,0.00007938262,0.000003961231,0.00008659514,0.0002473605],"genre_scores_gemma":[0.5348355,0.0000385702,0.4645718,0.0001047348,0.0003671559,5.808358e-7,0.000007332974,0.00003826503,0.00003609966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1393631,"threshold_uncertainty_score":0.8461344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01510272516198847,"score_gpt":0.2389728532338516,"score_spread":0.2238701280718632,"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."}}