Scheduling unrelated parallel batch processing machines with non-identical job sizes

- Problem of scheduling unrelated parallel batch processing machines with non-identical job sizes is studied in this paper. This problem has not been considered before.
- Several heuristics are proposed to solve the problem. As the existing heuristics cannot be used to solve the problem directly, heuristics are modified and new heuristics are proposed in this study.
- Heuristics proposed in this paper are classified into two Groups based on different schedule mechanisms.
- A lower bound of the problem was proved in this study.
- Experiment was conducted to evaluate the performances of the heuristics proposed. We find that heuristics that arrange jobs in the order of minimum processing time and allocate jobs or batches by using shortest completion time are better than others.