Minimizing makespan on a two-machine re-entrant flowshop

Cited 20 time in webofscience Cited 0 time in scopus
  • Hit : 624
  • Download : 91
This paper focuses on a two-machine re-entrant flowshop scheduling problem with the objective of minimizing makespan. 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. We develop dominance properties, lower bounds 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. Results of the experiments show that the suggested branch and bound algorithm can solve problems with up to 200 jobs in a reasonable amount of CPU time.
Publisher
PALGRAVE MACMILLAN LTD
Issue Date
2007-07
Language
English
Article Type
Article
Keywords

HEURISTIC ALGORITHM; SCHEDULING PROBLEMS; SEQUENCING PROBLEM; M-MACHINE; SHOPS; TIMES

Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.58, pp.972 - 981

ISSN
0160-5682
DOI
10.1057/palgrave.jors.2602220
URI
http://hdl.handle.net/10203/7613
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 20 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0