Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 353
  • Download : 2
We consider a two-machine re-entrant flowshop scheduling problem in which all jobs must be processed twice on each machine and there are sequence-dependent setup times on the second machine. For the problem with the objective of minimizing total tardiness, we develop dominance properties and a lower bound by extending those for a two-machine re-entrant flowshop problem (without sequence-dependent setup times) as well as heuristic algorithms, and present a branch and bound algorithm in which these dominance properties, lower bound, and heuristics are used. For evaluation of the performance of the branch and bound algorithm and heuristics, computational experiments are performed on randomly generated instances, and results are reported. (C) 2014 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2014-07
Language
English
Article Type
Article
Keywords

SCHEDULING PROBLEM; BOUND ALGORITHM; MAKESPAN; MINIMIZATION; HEURISTICS; BRANCH; SHOPS

Citation

COMPUTERS & OPERATIONS RESEARCH, v.47, pp.72 - 80

ISSN
0305-0548
DOI
10.1016/j.cor.2014.02.002
URI
http://hdl.handle.net/10203/189122
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0