EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search
  • A tabu search algorithm for th...
  • More details
Cover Image

A tabu search algorithm for the Open Shop problem

Year of publication:
1997
Authors: Alcaide, David ; Sicilia, Joaquín ; Vigo, Daniele
Published in:
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 5.1997, 2, p. 283-296
Publisher: Springer
Subject: Sequencing | Scheduling | Open Shop | Heuristics | Tabu Search
Saved in:
  • More details
Extent:
text/html
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://www.econbiz.de/10005755591
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • Two-machine flow shop and open shop scheduling problems with a single maintenance window

      Mosheiov, Gur, (2018)

    • A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times

      Mejía, Gonzalo, (2020)

    • Shop scheduling problems with pliable jobs

      Knust, Sigrid, (2019)

    • More ...
    Similar items by person
    • An approach to solve a hierarchical stochastic sequential ordering problem

      Alcaide, David, (2003)

    • Cyclic multiple-robot scheduling with time-window constraints using a critical path approach

      Alcaide, David, (2007)

    • Cyclic multiple-robot scheduling with time-window constraints using a critical path approach

      Alcaide, David, (2007)

    • More ...
    A service of the
    zbw
    • Sitemap
    • Plain language
    • Accessibility
    • Contact us
    • Imprint
    • Privacy

    Loading...