An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
From MaRDI portal
(Redirected from Publication:423933)
Recommendations
- Online batch scheduling on parallel machines with delivery times
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- On-line scheduling with delivery time on a single batch machine
- Online algorithms for batch machines scheduling with delivery times
Cites work
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- Approximation algorithms in batch processing
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- On-line algorithms for minimizing makespan on batch processing machines
- On-line scheduling algorithms for a batch machine with finite capacity
- On-line scheduling with delivery time on a single batch machine
- Optimal on-line algorithms for one batch machine with grouped processing times
Cited in
(21)- An improved approximation algorithm for single machine scheduling with job delivery
- Single-machine online scheduling of jobs with non-delayed processing constraint
- Online unbounded batch scheduling on parallel machines with delivery times
- Online over time scheduling on parallel-batch machines: a survey
- Online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery
- On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- Online algorithms for batch machines scheduling with delivery times
- On-line scheduling with delivery time on a single batch machine
- An optimal online algorithm for single machine scheduling with bounded delivery times
- Online scheduling on a parallel batch machine with delivery times and limited restarts
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery
- On-line algorithms for minimizing makespan and maximum delivery time on a single serial batch machine
- Online batch scheduling on parallel machines with delivery times
- Online NDP-constraint scheduling of jobs with delivery times or weights
- Online scheduling on a single machine with linear deteriorating processing times and delivery times
- Online scheduling on bounded parallel-batch machines
- A best on-line algorithm for single machine scheduling with small delivery times
This page was built for publication: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423933)