Optimally competitive list batching

DOI10.1016/J.TCS.2009.04.011MaRDI QIDQ837154zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Lawrence L. Larmore, J. Noga, Wolfgang W. Bein

Publication date 10 September 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.04.011

zbMATH Keywords

online algorithmsbatchingdesign of algorithmsTCP acknowledgment

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Algorithm Theory - SWAT 2004
• Optimal online-list batch scheduling
• Optimal on-line algorithms for one batch machine with grouped processing times
• Design and Analysis of Online Batching Systems
• Online batch scheduling on parallel machines with delivery times

Cites work

• scientific article; zbMATH DE number 2079320 (Why is no real title available?)
• scientific article; zbMATH DE number 866105 (Why is no real title available?)
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
• A class of on-line scheduling algorithms to minimize total completion time
• Batch scheduling with deadlines on parallel machines
• Batch sizing and job sequencing on a single machine
• Batching identical jobs
• Dynamic TCP acknowledgment in the LogP model
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• On minimizing total tardiness in a serial batching problem
• On the remote server problem or more about TCP acknowledgments
• On-line analysis of the TCP acknowledgment delay problem
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• On-line scheduling on a single machine: Minimizing the total completion time
• Scheduling a batching machine
• Scheduling algorithms
• Scheduling jobs that arrive over time
• Solving a chemical batch scheduling problem by local search
• The complexity of one-machine batching problems

Cited in

(4)

• Design and analysis of online batching systems
• Optimal online-list batch scheduling
• Algorithm Theory - SWAT 2004
• Design and Analysis of Online Batching Systems

This page was built for publication: Optimally competitive list batching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837154)