Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
From MaRDI portal
Publication:2576877
DOI10.1016/j.tcs.2005.07.028zbMath1080.68004OpenAlexW2081848918MaRDI QIDQ2576877
Zhaohui Liu, Cheng, T. C. Edwin
Publication date: 29 December 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/631
Related Items
When serial batch scheduling involves parallel batching decisions: a branch and price scheme, A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time, Bi-criteria scheduling on a single parallel-batch machine, Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan, The coordination of transportation and batching scheduling, TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS, Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times, Unbounded parallel-batch scheduling with drop-line tasks, Scheduling jobs with release dates on parallel batch processing machines
Cites Work