MIP formulations and heuristics for solving parallel batching problems
From MaRDI portal
Recommendations
- A new MIP model for parallel-batch scheduling with non-identical job sizes
- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
- Batching and scheduling. Models and methods for several problem classes
Cites work
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- Batch scheduling with deadlines on parallel machines
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient scheduling algorithms for a single batch processing machine
- scientific article; zbMATH DE number 1859343 (Why is no real title available?)
- scientific article; zbMATH DE number 1437089 (Why is no real title available?)
- Improved MILP models for two-machine flowshop with batch processing machines
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Minimizing total completion time on a batch processing machine with job families
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batches with simultaneous job processing for two-machine shop problems
- Scheduling with agreeable release times and due dates on a batch processing machine
- Scheduling with batching: A review
Cited in
(7)- Changeover formulations for discrete-time mixed-integer programming scheduling models
- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
- scientific article; zbMATH DE number 6501083 (Why is no real title available?)
- Batching multiple products on parallel heterogeneous machines in a closed job shop
- A new MIP model for parallel-batch scheduling with non-identical job sizes
- Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint
- A hybrid meta-heuristic for the batching problem in just-in-time flow shops
This page was built for publication: MIP formulations and heuristics for solving parallel batching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429916)
