Mixed integer formulation to minimize makespan in a flow shop with batch processing machines

DOI10.1016/j.mcm.2005.01.005zbMath1099.90018OpenAlexW1994812465MaRDI 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

zbMATH Keywords

SchedulingFlow shopBatch processingMathematical formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Improved MILP models for two-machine flowshop with batch processing machines ⋮ Minimizing makespan in a two-machine flowshop scheduling with batching and release time ⋮ A hybrid neural network approach to minimize total completion time on a single batch processing machine ⋮ MIP formulations and heuristics for solving parallel batching problems ⋮ A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines ⋮ Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines ⋮ Two-stage hybrid flow shop scheduling with dynamic job arrivals ⋮ Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes ⋮ A survey of scheduling with parallel batch (p-batch) processing

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

This page was built for publication: Mixed integer formulation to minimize makespan in a flow shop with batch processing machines