Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed

Cited 24 time in webofscience Cited 30 time in scopus
  • Hit : 258
  • Download : 0
This paper considers a scheduling problem concerned with a flowshop composed of two batch processing machines where a finite number of jobs arrive dynamically at the first machine of the flowshop. On each batch processing machine, jobs are processed in batch, and each batch is allowed to contain jobs possibly up to the maximum capacity of the associated machine. The objective is to find the optimal batching schedule which minimizes the maximum completion time of all jobs. In the analysis, several solution properties are characterized, based on which an efficient dynamic programming algorithm is developed.
Publisher
GORDON BREACH SCI PUBL LTD
Issue Date
1997-04
Language
English
Article Type
Article
Keywords

SINGLE

Citation

ENGINEERING OPTIMIZATION, v.28, no.3, pp.231 - 243

ISSN
0305-215X
DOI
10.1080/03052159708941133
URI
http://hdl.handle.net/10203/72422
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 24 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0