Advanced search
1 file | 651.37 KB

Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem

Author
Organization
Keywords
MAKESPAN MINIMIZATION, ALGORITHMS, LOCAL SEARCH, SAT, Machine scheduling

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 651.37 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Sels, Veronique, Jose Coelho, Antonio Manuel Dias, and Mario Vanhoucke. 2015. “Hybrid Tabu Search and a Truncated Branch-and-bound for the Unrelated Parallel Machine Scheduling Problem.” Computers & Operations Research 53: 107–117.
APA
Sels, V., Coelho, J., Dias, A. M., & Vanhoucke, M. (2015). Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem. COMPUTERS & OPERATIONS RESEARCH, 53, 107–117.
Vancouver
1.
Sels V, Coelho J, Dias AM, Vanhoucke M. Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem. COMPUTERS & OPERATIONS RESEARCH. 2015;53:107–17.
MLA
Sels, Veronique, Jose Coelho, Antonio Manuel Dias, et al. “Hybrid Tabu Search and a Truncated Branch-and-bound for the Unrelated Parallel Machine Scheduling Problem.” COMPUTERS & OPERATIONS RESEARCH 53 (2015): 107–117. Print.
@article{5840609,
  author       = {Sels, Veronique and Coelho, Jose and Dias, Antonio Manuel and Vanhoucke, Mario},
  issn         = {0305-0548},
  journal      = {COMPUTERS & OPERATIONS RESEARCH},
  keywords     = {MAKESPAN MINIMIZATION,ALGORITHMS,LOCAL SEARCH,SAT,Machine scheduling},
  language     = {eng},
  pages        = {107--117},
  title        = {Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem},
  url          = {http://dx.doi.org/10.1016/j.cor.2014.08.002},
  volume       = {53},
  year         = {2015},
}

Altmetric
View in Altmetric
Web of Science
Times cited: