Similar Search Results

Solving planning problems with noisy objective functions : a comparison of genetic algorithms, simulated annealing and tabu search, and the effect of noise on their performance

Konstroffer, Markus - 2001

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

A general-purpose hill-climbing method for order independent minimum grouping problems: a case study in graph colouring and bin packing

Lewis, Rhyd - In: Computers & operations research : and their … 36 (2009) 7, pp. 2295-2310

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

Analyzing the behaviors of virtual cells (VCs) and traditional manufacturing systems: ant colony optimization (ACO)-based metamodels

Kesen, Saadettin Erhan; Toksari, M. Duran; Güngör, Zülal - In: Computers & operations research : and their … 36 (2009) 7, pp. 2275-2285

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

Single machine scheduling algorithms : comparing simulated annealing and a genetic algorithm

Stockheim, Tim; Franke, Jochen; König, Wolfgang - In: Quantitative Methoden der Logistik und des Supply Chain …, (pp. 211-235). 2006

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

JIT mixed-model sequencing with batching and setup considerations via search heuristics

McMullen, Patrick R. - In: International journal of production research 48 (2010) 21/22, pp. 6559-6582

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

A comparison of three heuristics on a practical case of sub-daily staff scheduling

Günther, Maik; Nissen, Volker - In: The practice and theory of automated timetabling : …, (pp. 201-219). 2014

a set of staff scheduling problems derived from a practical case in logistics. All heuristics significantly outperform … conventional manual full-day planning, demonstrating the value of sub-daily scheduling heuristics. PSO delivers the best overall … suggests that agents could be an interesting method for real-time scheduling or re-scheduling tasks. …

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