Approximation algorithms in batch processing
From MaRDI portal
Recommendations
Cited in
(61)- Parallel-batch scheduling with rejection: structural properties and approximation algorithms
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
- Single machine batch scheduling with release times
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Online unbounded batch scheduling on parallel machines with delivery times
- Optimal online-list batch scheduling
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
- Best semi-online algorithms for unbounded parallel batch scheduling
- Online batch scheduling with kind release times and incompatible families to minimize makespan
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Optimal on-line algorithms for one batch machine with grouped processing times
- Online over time scheduling on parallel-batch machines: a survey
- On-line scheduling with rejection on identical parallel machines
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
- scientific article; zbMATH DE number 1629977 (Why is no real title available?)
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- On-line scheduling on a batch machine to minimize makespan with limited restarts
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Online scheduling of incompatible unit-length job families with lookahead
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Approximation of the \(k\)-batch consolidation problem
- An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- A two stage scheduling with transportation and batching
- Scheduling jobs with release dates on parallel batch processing machines
- Approximation for batching via priorities
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart
- On-line scheduling algorithms for a batch machine with finite capacity
- Optimal semi-online algorithm for scheduling on two parallel batch processing machines
- 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 scheduling unit length jobs on parallel-batch machines with lookahead
- On-line scheduling with delivery time on a single batch machine
- On-line scheduling of unit time jobs with rejection on uniform machines
- Scheduling an unbounded batching machine with job processing time compatibilities
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Research on the parallel-batch scheduling with linearly lookahead model
- Semi-online scheduling: a survey
- Online batch scheduling on parallel machines with delivery times
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- A coordination mechanism for a scheduling game with parallel-batching machines
- Approximation of a batch consolidation problem
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
- Online algorithms to schedule a proportionate flexible flow shop of batching machines
This page was built for publication: Approximation algorithms in batch processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1417850)
