Optimally competitive list batching
From MaRDI portal
Publication:837154
DOI10.1016/J.TCS.2009.04.011zbMATH Open1171.68053OpenAlexW2032752940MaRDI QIDQ837154FDOQ837154
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
Recommendations
Cites Work
- Scheduling a batching machine
- A class of on-line scheduling algorithms to minimize total completion time
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Scheduling algorithms
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Batch scheduling with deadlines on parallel machines
- The complexity of one-machine batching problems
- Batching identical jobs
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Batch sizing and job sequencing on a single machine
- Scheduling jobs that arrive over time
- On-line scheduling on a single machine: Minimizing the total completion time
- Solving a chemical batch scheduling problem by local search
- Title not available (Why is that?)
- On-line analysis of the TCP acknowledgment delay problem
- On minimizing total tardiness in a serial batching problem
- Dynamic TCP acknowledgment in the LogP model
- Title not available (Why is that?)
- On the remote server problem or more about TCP acknowledgments
Cited In (4)
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)
