Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33925
Title: One-machine batching and sequencing of multiple-type items
Authors: Cheng, TCE 
Chen, ZL
Oguz, C
Issue Date: 1994
Publisher: Pergamon Press
Source: Computers and operations research, 1994, v. 21, no. 7, p. 717-721 How to cite?
Journal: Computers and operations research 
Abstract: We consider a single-machine scheduling problem in which a given number of simultaneously available items of different types are to be processed. The items must first be batched and then sequenced before processing begins. Only items of the same type can be batched together. A setup time is incurred whenever a batch of a certain type of item is formed. The flowtime of an item in a batch is defined as the completion time of the batch that contains it. The problem is to find an optimal schedule in terms of the optimal batching and sequencing decisions that minimizes the total item flowtime. We present a dynamic programming algorithm to solve this problem. The algorithm has a running time polynomial in the number of items but exponential in the number of types.
URI: http://hdl.handle.net/10397/33925
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/0305-0548(94)90001-9
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

17
Last Week
0
Last month
0
Citations as of Sep 7, 2017

WEB OF SCIENCETM
Citations

17
Last Week
0
Last month
0
Citations as of Sep 12, 2017

Page view(s)

50
Last Week
2
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.