Cover Image

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:
Bibliographic Details
Main Authors: Kanesan , Muthusamy, Ishii, Hiroaki, Mohri, Shintaro, Teruo, Masuda
Format: Article
Published: International Society of Mathematical Sciences 2001
Subjects:
TS Manufactures
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!
id my.oum.624
record_format eprints
spelling my.oum.6242011-11-03T06:27:42Z Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations Kanesan , Muthusamy Ishii, Hiroaki Mohri, Shintaro Teruo, Masuda TS Manufactures 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) International Society of Mathematical Sciences 2001 Article PeerReviewed http://www.jams.or.jp/notice/scmjol/ 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 http://library.oum.edu.my/repository/624/
institution Open University Malaysia
building OUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Open University Malaysia
content_source OUM Knowledge Repository
url_provider http://library.oum.edu.my/repository/
topic TS Manufactures
spellingShingle TS Manufactures
Kanesan , Muthusamy
Ishii, Hiroaki
Mohri, Shintaro
Teruo, Masuda
Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
description 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)
format Article
author Kanesan , Muthusamy
Ishii, Hiroaki
Mohri, Shintaro
Teruo, Masuda
author_facet Kanesan , Muthusamy
Ishii, Hiroaki
Mohri, Shintaro
Teruo, Masuda
author_sort Kanesan , Muthusamy
title Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
title_short Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
title_full Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
title_fullStr Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
title_full_unstemmed Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
title_sort single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
publisher International Society of Mathematical Sciences
publishDate 2001
url http://www.jams.or.jp/notice/scmjol/
http://library.oum.edu.my/repository/624/
_version_ 1644309027131228160
score 13.209306

Similar Items