A flexible on-line scheduling algorithm for batch machine with infinite capacity
From MaRDI portal
Recommendations
- On-line scheduling algorithms for a batch machine with finite capacity
- A best online algorithm for scheduling on two parallel batch machines
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- Optimal on-line algorithms for one batch machine with grouped processing times
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Cites work
- scientific article; zbMATH DE number 1629977 (Why is no real title available?)
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- On-line algorithms for minimizing makespan on batch processing machines
- Scheduling a batching machine
- Scheduling one batch processor subject to job release dates
Cited in
(19)- On-line scheduling algorithms for a batch machine with finite capacity
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- Optimal on-line algorithms for one batch machine with grouped processing times
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- A best online algorithm for scheduling on two parallel batch machines
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Online scheduling of incompatible unit-length job families with lookahead
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- Online batch scheduling with kind release times and incompatible families to minimize makespan
- Single machine batch scheduling with release times
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
- Online over time scheduling on parallel-batch machines: a survey
- Optimal online-list batch scheduling
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
This page was built for publication: A flexible on-line scheduling algorithm for batch machine with infinite capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772971)
