Similar Search Results

Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs

Varmazyar, Mohsen; Salmasi, Nasser - In: International journal of production research 50 (2012) 20, pp. 5843-5858

Persistent link: https://www.econbiz.de/10009670334

An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems

Shahvari, Omid; Salmasi, Nasser; Logendran, Rasaratnam; … - In: International journal of production research 50 (2012) 15, pp. 4237-4254

Persistent link: https://www.econbiz.de/10009621271

An adaptive multistart tabu search approach to solve the maximum clique problem

Wu, Qinghua; Hao, Jin-Kao - In: Journal of combinatorial optimization 26 (2013) 1, pp. 86-108

Persistent link: https://www.econbiz.de/10009757251

Solving an one-dimensional cutting stock problem by simulated annealing and tabu search

Jahromi, Meghdad HMA; Tavakkoli-Moghaddam, Reza; Makui, … - In: Journal of industrial engineering international 8 (2012), pp. 1-8

A cutting stock problem is one of the main and classical problems in operations research that is modeled as LP problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms,...

Persistent link: https://www.econbiz.de/10009758828

Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm

Yousefikhoshbakht, Majid; Didehvar, Farzad; Rahmati, Farhad - In: International journal of production research 52 (2014) 9, pp. 2565-2575

Persistent link: https://www.econbiz.de/10010351895

A tabu search heuristic for building aircraft maintenance personnel rosters

De Bruecker, Philippe; Van de Bergh, Jorne; Beliën, Jeroen - 2014

Persistent link: https://www.econbiz.de/10010357809

Frequency optimization in public transportation systems : formulation and metaheuristic approach

Martínez, Héctor; Mauttone, Antonio; Urquhart, María E. - In: European journal of operational research : EJOR 236 (2014) 1, pp. 27-36

Persistent link: https://www.econbiz.de/10010361317

The robust (minmax regret) quadratic assignment problem with interval flows

Feizollahi, Mohammad Javad; Averbakh, Igor - In: INFORMS journal on computing : JOC 26 (2014) 2, pp. 321-335

Persistent link: https://www.econbiz.de/10010362439

Simulated annealing and tabu search approaches for the Corridor Allocation Problem

Ahonen, Hannu; Alvarenga, Arlindo G. de; Amaral, André … - In: European journal of operational research : EJOR 232 (2014) 1, pp. 221-233

Persistent link: https://www.econbiz.de/10010224715

Tabu-enhanced iterated greedy algorithm : a case study in the quadratic multiple knapsack problem

García Martínez, Carlos; Rodriguez, Francisco J.; … - In: European journal of operational research : EJOR 232 (2014) 3, pp. 454-463

Persistent link: https://www.econbiz.de/10010224974