Batching to minimize weighted mean flow time on a single machine with batch size restrictions

Cited 4 time in webofscience Cited 8 time in scopus
  • Hit : 270
  • Download : 0
This paper considers a single machine job batching problem with multiple job types involved where each given type of job is allowed to split into several batches whose individual sizes are varied in integral number and restricted between lower and upper bounds. Major and minor setup times are also involved in batch sequencing. The objective is to find the optimal job batching and sequencing for minimizing weighted mean flow time which is measured in the ''batch-flow'' concept. In the analysis, a feasibility condition is derived to take care of the batch size restrictions, and some solution properties are characterized. These are used to exploit a dynamic programming algorithm, and also to suggest an effective heuristic algorithm. (C) 1997 Elsevier Science Ltd.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1997
Article Type
Article
Citation

COMPUTERS & INDUSTRIAL ENGINEERING, v.32, no.2, pp.333 - 340

ISSN
0360-8352
DOI
10.1016/S0360-8352(96)00300-2
URI
http://hdl.handle.net/10203/70672
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0