Approximation for Batching via Priorities
We consider here the one-machine serial batching problem under weighted average completion. This problem is known to be $cal Ncal P$-hard and no good approximation algorithms are known. Batching has wide application in manufacturing, decision management, and scheduling in information technology....
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Alexandru Ioan Cuza University of Iasi
2007-12-01
|
| Series: | Scientific Annals of Computer Science |
| Online Access: | http://www.info.uaic.ro/bin/download/Annals/XVII/XVII_0.pdf |