Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
type: Item
instance of: scholarly article
title: Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
zbMATH Open document ID: 1251.90179
author: Mohamed Ali Rakrouki
author: Talel Ladhari
author: Vincent T'kindt
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6107556
zbMATH Keywords: single machine
zbMATH Keywords: release dates
zbMATH Keywords: heuristics
zbMATH Keywords: genetic local search
zbMATH Keywords: genetic recovering beam search
describes a project that uses: Beam-ACO
MaRDI profile type: Publication
full work available at URL: j.cor.2010.12.007
OpenAlex ID: W2053614986
cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
cites work: Hybridizations of Metaheuristics With Branch & Bound Derivates
cites work: Hybrid Metaheuristics: An Introduction
cites work: Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
cites work: An iterative heuristic for the single machine dynamic total completion time scheduling problem
cites work: Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
cites work: The noising method: A new method for combinatorial optimization
cites work: Efficient heuristics to minimize total flow time with release dates
cites work: Q4017560
cites work: Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
cites work: Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
cites work: A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
cites work: Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
cites work: Unrelated parallel machine scheduling using local search
cites work: A branch-and-bound-based local search method for the flow shop problem
cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
cites work: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
cites work: Dominance-based heuristics for one-machine total cost scheduling problems
cites work: Hybridizing exact methods and metaheuristics: a taxonomy
cites work: Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
cites work: Effective heuristics for the single machine sequencing problem with ready times
cites work: The Single Machine Early/Tardy Problem
cites work: Minimizing maximum lateness on one machine: computational experience and some applications
cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
cites work: Revisiting branch and bound search strategies for machine scheduling problems
cites work: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
DOI: 10.1016/J.COR.2010.12.007
description: scientific article; zbMATH DE number 6107556