| Article ID: | iaor2006470 |
| Country: | China |
| Volume: | 8 |
| Issue: | 3 |
| Start Page Number: | 39 |
| End Page Number: | 44 |
| Publication Date: | Aug 2004 |
| Journal: | OR Transactions |
| Authors: | Tang Guochun, Liu Lili |
| Keywords: | heuristics, programming: branch and bound |
A batch machine or batching processing machine is one that can process several jobs simultaneously. We study the problem of minimizing the total weighted completion time on a batch machine. The computational complexity of this problem is open. We provide an exact solution procedure – a branch and bound approach and heuristic algorithms for it, and compare the heuristics with considerable instances.