An efficient hybrid search algorithm for job shop scheduling with operators
Year of publication: |
2013
|
---|---|
Authors: | Mencía, Carlos ; Sierra, María R. ; Varela, Ramiro |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 51.2013, 17 (1.9.), p. 5221-5237
|
Subject: | job shop scheduling with operators | total flow time | best-first search | depth-first search | hybrid search algorithms | anytime algorithms | global pruning rules | Suchtheorie | Search theory | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics |
-
An extensive tabu search algorithm for solving the lot streaming problem in a job shop environment
Shen, Liji, (2008)
-
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Zhu, Jie, (2009)
-
A bicriteria traveling salesman problem with sequence priorities
Schmitz, Heinz, (2009)
- More ...
-
Depth-first heuristic search for the job shop scheduling problem
Mencía, Carlos, (2013)
-
Depth-first heuristic search for the job shop scheduling problem
Mencía, Carlos, (2013)
-
An effective solution for a real cutting stock problem in manufacturing plastic rolls
Varela, Ramiro, (2009)
- More ...