Dynamic job assignment heuristics for multi-server batch operations- A cost based approach

DOI10.1080/002075497194291zbMath0946.90525OpenAlexW2112115821MaRDI QIDQ4245364

No author found.

Publication date: 5 October 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075497194291

Mathematics Subject Classification ID

Production models (90B30)

Related Items (11)

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 ⋮ Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices ⋮ Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches ⋮ 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 ⋮ Dynamic scheduling of batch servers with compatible product families ⋮ Dynamic scheduling of batch-processing machines with non-identical product sizes ⋮ Adaptive scheduling of batch servers in flow shops ⋮ A survey of scheduling with parallel batch (p-batch) processing

This page was built for publication: Dynamic job assignment heuristics for multi-server batch operations- A cost based approach