Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
From MaRDI portal
Recommendations
- Dynamic scheduling of batch servers with compatible product families
- Adaptive scheduling of batch servers in flow shops
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Optimal control of assignment of jobs to processors under heavy traffic
- Analysis of job assignment with batch arrivals among heterogeneous servers
Cited in
(12)- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Makespan minimization on single batch-processing machine via ant colony optimization
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- A survey of scheduling with parallel batch (p-batch) processing
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
- Non-exhaustive family based dispatching heuristics-exploiting variances of processing and set-up times
- Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance
- Dynamic scheduling of batch servers with compatible product families
- Adaptive scheduling of batch servers in flow shops
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches
- Instance space analysis and algorithm selection for a parallel batch scheduling problem
This page was built for publication: Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4245364)
