Scheduling a batch processing machine with non-identical job sizes
From MaRDI portal
Recommendations
- Scheduling a single batch processing machine with non-identical job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Batch scheduling of nonidentical job sizes with minsum criteria
- Scheduling parallel batch processing machines with non-identical job sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
Cited in
(29)- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
- A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs
- Column generation for minimizing total completion time in a parallel-batching environment
- A survey of scheduling with parallel batch (p-batch) processing
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- A solution framework for scheduling a BPM with non-identical job dimensions
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
- An effective formulation for optimal scheduling of multistage multi-product batch plant based on due dates
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
- Heuristic scheduling of jobs on a multi-product batch processing machine
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- Dynamic scheduling of batch servers with compatible product families
- Exact approaches for single machine total weighted tardiness batch scheduling
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Scheduling with batching: Two job types
- A hybrid neural network approach to minimize total completion time on a single batch processing machine
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
- Parallel batching with multi-size jobs and incompatible job families
- A new class of lower bounds for scheduling a batch processing machine to minimize makespan
- Scheduling an unbounded batching machine with job processing time compatibilities
- Scheduling about a common due date with earliness and tardiness penalties
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
This page was built for publication: Scheduling a batch processing machine with non-identical job sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4510514)
