Kanesan , Muthusamy and Ishii, Hiroaki and Mohri, Shintaro and Teruo, Masuda (2001) Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations. Scientiae Mathematicae Japonicae, 55 (2). pp. 369-381. ISSN 1346-0447
Full text not available from this repository.
Official URL: http://www.jams.or.jp/notice/scmjol/
Abstract
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)
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Scheduling, single machine, polynomial algorithm, sum of completion times |
| Subjects: | T Technology > TS Manufactures |
| Divisions: | Faculty of Science and Technology |
| Depositing User: | Shahril Effendi Ibrahim |
| Date Deposited: | 03 Nov 2011 06:27 |
| Last Modified: | 03 Nov 2011 06:27 |
| URI: | http://library.oum.edu.my/repository/id/eprint/624 |
Actions (login required)
 |
View Item |
