A Dynamic Programming Heuristic for Single-Batch Processing Machine Problem

We consider the problem of minimizing the total completion time (or total flow time) on a single-batch processing machine. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. The paper gives an efficient heuristic procedure leading to a solution close to the optimal one.

کلیدواژه ها:

Scheduling ، Flow time ، Batch processing ، Dynamic programming ، Heuristic