Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
We consider single machine batch scheduling problem for identical jobs. Constant processing times and batch setup times are assumed together with batch size and number of batch constraints. We present a polynomially bounded algorithm that minimizes the sum of completion times. (Abstract by authors)
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
International Society of Mathematical Sciences
2001
|
| Subjects: | |
| Online Access: | http://www.jams.or.jp/notice/scmjol/ http://library.oum.edu.my/repository/624/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|