A tabu search approach for a single-mach
✍
Johann Hurink
📂
Article
📅
1998
🏛
Springer US
🌐
English
⚖ 153 KB
👁 1 views
In this paper we present a tabu search approach for a single-machine batching problem. A set of jobs has to be scheduled on a batching machine. This machine is able to handle several jobs simultaneously. The time for processing a subset of jobs simultaneously is equal to the sum of the processing ti