Minimizing total tardiness on a two-machine re-entrant flowshop

Cited 25 time in webofscience Cited 0 time in scopus
  • Hit : 270
  • Download : 0
We present a branch and bound algorithm for a two-machine re-entrant flowshop scheduling problem with the objective of minimizing total tardiness. In the re-entrant flowshop considered here, all jobs must be processed twice on each machine, that is, each job should be processed on machine 1, machine 2 and then machine 1 and machine 2. By regarding a job as a pair of sub-jobs, each of which represents a pass through the two machines, we develop dominance properties, a lower bound and heuristic algorithms for the problem, and use these to develop a branch and bound algorithm. For evaluation of the performance of the algorithms, computational experiments are performed on randomly generated test problems and results are reported. Results of the experiments show that the suggested branch and bound algorithm can solve problems with up to 20 sub-jobs in a reasonable amount of CPU time, and the average percentage gap of the heuristic solutions is about 13%. (C) 2008 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2009-12
Language
English
Article Type
Article
Keywords

SCHEDULING PROBLEM; HEURISTIC ALGORITHM; SEQUENCING PROBLEM; MEAN TARDINESS; M-MACHINE; MAKESPAN; SHOP; BRANCH

Citation

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.199, no.2, pp.375 - 384

ISSN
0377-2217
DOI
10.1016/j.ejor.2008.11.037
URI
http://hdl.handle.net/10203/94745
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 25 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0