Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times

Cited 13 time in webofscience Cited 0 time in scopus
  • Hit : 250
  • Download : 0
We consider a two-machine flowshop scheduling problem in which jobs should be processed on the second machine within a certain period of time after those jobs are completed on the first machine, and sequence-dependent setup times are required on the second machine. For the problem with the objective of minimizing makespan, we develop several dominance properties, lower bounds, and heuristic algorithms, 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 instances. Results of the experiments show that the suggested branch and bound algorithm can solve problems with up to 30 jobs in a reasonable amount of CPU time. (C) 2016 Elsevier Ltd. All rights reserved
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2016-07
Language
English
Article Type
Article
Keywords

DYNAMIC-PROGRAMMING APPROACH; SHOP SCHEDULING PROBLEMS; REENTRANT FLOWSHOP; SALESMAN PROBLEM; TOTAL TARDINESS; MEAN TARDINESS; ALGORITHM; MACHINE; HEURISTICS; BRANCH

Citation

COMPUTERS & OPERATIONS RESEARCH, v.71, pp.127 - 136

ISSN
0305-0548
DOI
10.1016/j.cor.2016.01.017
URI
http://hdl.handle.net/10203/209469
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 13 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0