Metaheuristics in combinatorial optimization: Overview and conceptual comparison

C Blum, A Roli - ACM computing surveys (CSUR), 2003 - dl.acm.org
The field of metaheuristics for the application to combinatorial optimization problems is a
rapidly growing field of research. This is due to the importance of combinatorial optimization …

An overview of heuristic solution methods

EA Silver - Journal of the operational research society, 2004 - Taylor & Francis
Besides those analysts who are already familiar with a number of heuristic methods, this
paper should also be of interest to those analysts and managers who, although not yet …

[BOOK][B] Multicriteria scheduling: theory, models and algorithms

V T'kindt, JC Billaut - 2006 - books.google.com
Scheduling and multicriteria optimisation theory have been subject, separately, to numerous
studies. Since the last twenty years, multicriteria scheduling problems have been subject to …

Hybrid metaheuristics: an introduction

C Blum, A Roli - Hybrid metaheuristics: an emerging approach to …, 2008 - Springer
In many real life settings, high quality solutions to hard optimization problems such as flight
scheduling or load balancing in telecommunication networks are required in a short amount …

[BOOK][B] Using applied mathematical models for business transformation

A Trad - 2019 - books.google.com
Traditional business practices have been left behind due to the increased use of data
analytics and information technology in companies worldwide. This development has led to …

Uric acid as a risk factor for progression of non-diabetic chronic kidney disease? The Mild to Moderate Kidney Disease (MMKD) Study

G Sturm, B Kollerits, U Neyer, E Ritz… - Experimental …, 2008 - Elsevier
The kidney is one of the organs most prominently affected by aging. This can be seen by a
loss of renal mass which is caused by a decrease in the number of nephrons resulting in …

Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach

M Ghirardi, CN Potts - European Journal of Operational Research, 2005 - Elsevier
This paper considers the problem of scheduling jobs on unrelated parallel machines to
minimize the makespan. Recovering Beam Search is a recently introduced method for …

Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times

A Parmentier, V T'kindt - European Journal of Operational Research, 2023 - Elsevier
In this paper, we focus on the solution of a hard single machine scheduling problem by new
heuristic algorithms embedding techniques from machine learning and scheduling theory …

Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups

JMS Valente, RAFS Alves - Computers & Operations Research, 2008 - Elsevier
In this paper, we consider the single machine weighted tardiness scheduling problem with
sequence-dependent setups. We present heuristic algorithms based on the beam search …

Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems

FD Croce, M Ghirardi, R Tadei - Journal of Heuristics, 2004 - Springer
A hybrid heuristic method for combinatorial optimization problems is proposed that
combines different classical techniques such as tree search procedures, bounding schemes …