Novel mathematical formulations for parallel-batching processing machine scheduling problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- A constraint programming approach for a batch processing problem with non-identical job sizes
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- A survey of scheduling with parallel batch (p-batch) processing
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- Arc-flow approach for single batch-processing machine scheduling
- Batching to Minimize Flow Times on One Machine
- CP and hybrid models for two-stage batching and scheduling
- Column generation for minimizing total completion time in a parallel-batching environment
- Dynamic scheduling on a single batch processing machine with split compatibility graphs
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Exact approaches for single machine total weighted tardiness batch scheduling
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
- Logic-based Benders decomposition for scheduling a batching machine
- Lower bounds and reduction procedures for the bin packing problem
- Makespan minimization on single batch-processing machine via ant colony optimization
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel batching with multi-size jobs and incompatible job families
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Scheduling batch processing machines with incompatible job families
- Scheduling on a batch machine with job compatibilities
- Scheduling one batch processor subject to job release dates
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Scheduling. Theory, algorithms, and systems
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
Cited in
(3)
This page was built for publication: Novel mathematical formulations for parallel-batching processing machine scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979027)
