Minimizing maximum lateness on identical parallel batch processing machines
From MaRDI portal
Recommendations
- Scheduling jobs with release dates on parallel batch processing machines
- Minimizing makespan with release times on identical parallel batching machines
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
- Scheduling problems on parallel identical unbounded batch processing machines
Cited in
(15)- Scheduling jobs with release dates on parallel batch processing machines
- Batching identical jobs
- Minimizing makespan with release times on identical parallel batching machines
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
- Batching to Minimize Flow Times on Parallel Heterogeneous Machines
- Scheduling problems on parallel identical unbounded batch processing machines
- The PTAS for the problem of \(P_m|r_j,B|\sum C_j\)
- An efficient PTAS for semiconductor burn-in scheduling with release dates to minimize maximum delivery time
- A PTAS for scheduling on agreeable unrelated parallel batch processing machines with dynamic job arrivals
- Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan
- Minimization of maximum lateness on parallel machines with a single server and job release dates
This page was built for publication: Minimizing maximum lateness on identical parallel batch processing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4681181)