Minimizing Due Date Related Peformance Measures on Two Batch Processing Machines

Cited 34 time in webofscience Cited 0 time in scopus
  • Hit : 645
  • Download : 0
This paper considers a scheduling problem in a two-machine flowshop of two batch processing machines. On each batch processing machine, jobs are processed in a batch, and each batch is allowed to contain jobs up to the maximum capacity of the associated machine. The scheduling problem is analyzed with respect to three due date related objectives including maximum tardiness, number of tardy jobs and total tardiness. In the analysis, several solution properties are characterized and based upon these properties, three efficient polynomial time algorithms are developed for minimizing the due date related measures. (C) 2002 Elsevier Science B.V. All rights reserved.
Publisher
Elsevier Science Bv
Issue Date
2003-06
Language
English
Article Type
Article
Keywords

TOTAL COMPLETION-TIME; BURN-IN OPERATIONS; JOB FAMILIES; ALGORITHMS

Citation

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.147, no.3, pp.644 - 656

ISSN
0377-2217
URI
http://hdl.handle.net/10203/80321
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 34 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0