Scheduling in a Two-machine Flowshop with Batch Processing Machine(s) for Earliness/Tardiness Measure under a Common Due Date

Cited 38 time in webofscience Cited 0 time in scopus
  • Hit : 257
  • Download : 0
This paper considers a scheduling problem for a two-machine flowshop with batch processing machine(s) (BPMs) incorporated where the earliness/tardiness (EIT) measure and a common due date are considered. It assumes that each batch has the same processing time and that the common due date is not set earlier than the total job processing time on the first machine. Under these assumptions, some solution properties are characterized for three different problem cases to derive their associated solution algorithms. For the first two cases concerned with two different machine sequences such as batch-to-discrete and batch-to-batch machine sequences, a polynomial time algorithm is derived based on some of the solution properties. For the last case concerned with discrete-to-batch machine sequence, a pseudopolynomial algorithm is exploited. (C) 2001 Elsevier Science B.V. All rights reserved.
Publisher
North-Holland Pub. Co. Elsevier Science Ltd
Issue Date
2001-05
Language
English
Article Type
Article
Keywords

SINGLE-MACHINE; EARLINESS-TARDINESS; COMPLETION TIMES; DUE-DATE; RESTRICTIVE COMMON; PENALTIES; DEVIATION; SUM

Citation

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.131, no.1, pp.95 - 106

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

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0