Tabu search for global optimization of continuous functions with application to phase equilibrium calculations

YS Teh, GP Rangaiah - Computers & Chemical Engineering, 2003 - Elsevier
Tabu (or taboo) search (TS) has been successfully applied to combinatorial optimization but
it has not been used for global optimization of many continuous functions including phase …

A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop …

E Figielska - Computers & Industrial Engineering, 2009 - Elsevier
In this paper, a heuristic is proposed for solving the problem of scheduling in a two-stage
flowshop with parallel unrelated machines and additional renewable resources at the first …

Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function

NQ Nguyen, F Yalaoui, L Amodeo, H Chehade… - Computers & Operations …, 2018 - Elsevier
In this paper, we consider an identical parallel machine scheduling problem with a single
additional resource. The processing rate of a job is defined by a linear resource …

Simulated annealing and tabu search for discrete-continuous project scheduling with discounted cash flows

G Waligóra - RAIRO-Operations Research, 2014 - cambridge.org
Discrete-continuous project scheduling problems with positive discounted cash flows and
the maximization of the NPV are considered. We deal with a class of these problems with an …

A tabu based neural network learning algorithm

J Ye, J Qiao, M Li, X Ruan - Neurocomputing, 2007 - Elsevier
This paper presents a novel neural network learning algorithm, the tabu-based neural
network learning algorithm (TBBP). In our work, the TBBP mainly use the tabu search (TS) to …

A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan

J Józefowska, M Mika, R Różycki… - Journal of …, 2002 - Wiley Online Library
A problem of scheduling jobs on parallel, identical machines under an additional continuous
resource to minimize the makespan is considered. Jobs are non‐preemtable and …

Tabu search for discrete–continuous scheduling problems with heuristic continuous resource allocation

G Waligora - European Journal of Operational Research, 2009 - Elsevier
Problems of scheduling non-preemptable, independent jobs on parallel identical machines
under an additional continuous renewable resource to minimize the makespan are …

A new heuristic for scheduling the two-stage flowshop with additional resources

E Figielska - Computers & Industrial Engineering, 2008 - Elsevier
This paper deals with the problem of preemptive scheduling in a two-stage flowshop with
parallel unrelated machines at the first stage and a single machine at the second stage. At …

Constraint Oriented Neighbourhoods—A New Search Strategy in Metaheuristics

A Viana, JP Sousa, MA Matos - Metaheuristics: progress as real problem …, 2005 - Springer
One major practical problem when applying traditional metaheuristics seems to be their
strong dependency on parameter tuning. This issue is frequently pointed out as a major …

Resource level minimization in the discrete–continuous scheduling

M Gorczyca, A Janiak - European Journal of Operational Research, 2010 - Elsevier
A discrete–continuous problem of non-preemptive task scheduling on identical parallel
processors is considered. Tasks are described by means of a dynamic model, in which the …