Control of a batch-processing machine: A computational approach
From MaRDI portal
Recommendations
- Stochastic scheduling of a batch processing machine with incompatible job families
- A stochastic batching and scheduling problem
- Controlling job arrivals with processing time windows into batch processor buffer
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance
Cited in
(19)- Makespan minimization on single batch-processing machine via ant colony optimization
- Modeling and optimization of the throughput of the processing nodes in computer-aided control systems of distributed production of printer matter
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- A survey of scheduling with parallel batch (p-batch) processing
- Online scheduling of incompatible unit-length job families with lookahead
- Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes
- Studies on analysis and coordination control of batch processes based on Dioid model
- A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
- scientific article; zbMATH DE number 5864714 (Why is no real title available?)
- Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- A neural network approach for batching decisions in wafer fabrication
- Dynamic scheduling of batch servers with compatible product families
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Online over time scheduling on parallel-batch machines: a survey
- Learning effective dispatching rules for batch processor scheduling
- Controlling job arrivals with processing time windows into batch processor buffer
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
This page was built for publication: Control of a batch-processing machine: A computational approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4245710)