Scheduling jobs with release dates on parallel batch processing machines
From MaRDI portal
Recommendations
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Parallel batch scheduling of equal-length jobs with release and due dates
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
- Single machine parallel-batch scheduling with release dates and machine availability constraints
- Parallel-machine scheduling with release dates and rejection
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Batch scheduling with deadlines on parallel machines
- Scheduling with agreeable release times and due dates on a batch processing machine
Cites work
- A PTAS for semiconductor burn-in scheduling
- Approximation algorithms in batch processing
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
- Computing and Combinatorics
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing makespan with release times on identical parallel batching machines
- Minimizing mean completion time in a batch processing system
- On scheduling an unbounded batch machine
- Scheduling a batching machine
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
Cited in
(20)- Batching and Scheduling Jobs on Batch and Discrete Processors
- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
- Subdivision-based digital geometry processing as a fundamental building block of digital manufacturing
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Computing and Combinatorics
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs
- Batch scheduling with deadlines on parallel machines: an NP-hard case
- Scheduling one batch processor subject to job release dates
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms
- Minimization of maximum lateness on parallel machines with a single server and job release dates
- Parallel batch scheduling of equal-length jobs with release and due dates
- Scheduling jobs with release times on a machine with finite storage
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Scheduling problems on parallel identical unbounded batch processing machines
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
This page was built for publication: Scheduling jobs with release dates on parallel batch processing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026144)
