A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
From MaRDI portal
Publication:1029348
DOI10.1016/j.tcs.2009.02.014zbMath1177.90166MaRDI QIDQ1029348
Ali Husseinzadeh Kashan, Behrooz Karimi, Seyyed Mohammad Taghi Fatemi Ghomi
Publication date: 10 July 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.014
90B35: Deterministic scheduling theory in operations research
Related Items
Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes, A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines, An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes, Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes, A constraint programming approach for a batch processing problem with non-identical job sizes, Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
Cites Work
