{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156801,0.001107299,0.002527435,0.001187696,0.0008152988,0.001204147,0.001778153,0.0009715289,0.00398381],"category_scores_gemma":[0.00267823,0.0007769735,0.0008284095,0.002536076,0.0005172493,0.001211081,0.0004837803,0.0008556846,0.0004577516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00171387,"about_ca_system_score_gemma":0.002832128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005263982,"about_ca_topic_score_gemma":0.00744525,"domain_scores_codex":[0.9992093,0.0002220975,0.00003505641,0.0001549623,0.0002194798,0.0001590828],"domain_scores_gemma":[0.998473,0.0009326581,0.0001396064,0.0001108223,0.0002389319,0.000105063],"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.0004952464,0.0002243389,0.0003537838,0.0001966579,0.00007355877,0.00005426879,0.0000384612,0.9319128,0.00878522,0.004574912,0.003827994,0.04946266],"study_design_scores_gemma":[0.0000320235,0.00009355252,0.0002279513,0.000003750257,0.00001643479,0.00001458097,0.000009373295,0.9950841,0.002102303,0.002077525,0.0003321926,0.000006248035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1853488,0.0009714607,0.8032795,0.0005070487,0.000393823,0.0004370345,0.0006233933,0.001282576,0.007156349],"genre_scores_gemma":[0.7131025,0.0003745979,0.2759288,0.0001007975,0.000155143,0.0003291276,0.0004151391,0.0003997459,0.009194199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005263982,"threshold_uncertainty_score":0.01332712,"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."}}