A Novel Matrix Approach to Determine Makespan for Zero-Wait Batch Processes
From MaRDI portal
Publication:3606053
Recommendations
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Analysis of deadlock and circular waits using a matrix model for flexible manufacturing systems
- Matrix-analytic solutions in production lines without buffers
This page was built for publication: A Novel Matrix Approach to Determine Makespan for Zero-Wait Batch Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606053)