A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

This publication has 15 references indexed in Scilit:

• A best online algorithm for scheduling on two parallel batch machines
  Theoretical Computer Science, 2009
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
  Operations Research Letters, 2008
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
  Operations Research Letters, 2005
• Single machine parallel batch scheduling subject to precedence constraints
  Naval Research Logistics (NRL), 2004
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
  Theoretical Computer Science, 2004
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
  Operations Research Letters, 2002
• On‐line algorithms for minimizing makespan on batch processing machines
  Naval Research Logistics (NRL), 2001
• Scheduling one batch processor subject to job release dates
  Discrete Applied Mathematics, 2000
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
  International Journal of Production Research, 1999
• Scheduling a single batch processing machine with non-identical job sizes
  International Journal of Production Research, 1994