To evaluate the robustness of the algorithms in different situations, a means plot for the interaction between the different algorithms in (1) different size of problems (2) number of batch processing machines and (3) number of jobs are shown in Figs.
This paper presents a permutation flow shop batch processing machines scheduling problem in which a batch of jobs can be simultaneously processed on machines.
As a direction for future research, it could be considered to extend the batch processing model developed in this paper to the other complex environments like job shops and open shops or even other variants of flow shop scheduling.
Minimizing makespan on parallel batch processing machines.
Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithm.
Minimizing makespan on a batch processing machine with non-identical job sizes using genetic algorithms.
Mixed integer formulation to minimize makespan in flow shop with batch processing machines, Mathematical and Computer Modeling, 40: 1465-1472.
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes.
This stand-alone equipment is often easily added to existing batch processing lines to provide increased product handling capability and flexibility.
A fourth answer for achieving new processing goals may be retrofitting new specialized equipment to existing batch processing systems.
Selection of a supplier to provide batch processing retrofit components or systems should be based on the supplier's approach to system design.