Online batch scheduling on parallel machines with delivery times
From MaRDI portal
Publication:719274
DOI10.1016/j.tcs.2011.06.011zbMath1222.68049OpenAlexW1970812428MaRDI QIDQ719274
Yang Fang, Peihai Liu, Xi-wen Lu
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.011
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production ⋮ Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time ⋮ A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ Online scheduling on a single machine with linear deteriorating processing times and delivery times ⋮ Single-machine batch scheduling of linear deteriorating jobs ⋮ Online unbounded batch scheduling on parallel machines with delivery times
Cites Work
- Unnamed Item
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- On-line scheduling with delivery time on a single batch machine
- Approximation algorithms in batch processing
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
This page was built for publication: Online batch scheduling on parallel machines with delivery times
