Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
From MaRDI portal
Publication:2486757
DOI10.1016/j.mcm.2005.01.005zbMath1099.90018MaRDI QIDQ2486757
Purushothaman Damodaran, Krishnaswami Srihari
Publication date: 17 August 2005
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2005.01.005
90C35: Programming involving graphs or networks
90B35: Deterministic scheduling theory in operations research
Related Items
Improved MILP models for two-machine flowshop with batch processing machines, Minimizing makespan in a two-machine flowshop scheduling with batching and release time
Cites Work
- Unnamed Item
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling with agreeable release times and due dates on a batch processing machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Two-machine flowshop scheduling with a secondary criterion
- Minimizing due date related performance measures on two batch processing machines
- Scheduling with batching: A review
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- Minimizing total completion time on a batch processing machine with job families
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling a single batch processing machine with non-identical job sizes
