Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints
From MaRDI portal
Publication:3098286
Recommendations
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling parallel batch processing machines with non-identical job sizes
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Multiobjective scheduling of jobs with incompatible families on parallel batch machines
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
Cited in
(10)- Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
- An algorithm of asymmetric three workshops integrated scheduling with batch equalization processing
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs
- Coordinating decentralized local schedulers in complex supply chain manufacturing
- A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- Genetic algorithm for job scheduling with maintenance consideration in semiconductor manufacturing process
- A survey of scheduling with parallel batch (p-batch) processing
This page was built for publication: Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098286)
