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
From MaRDI portal
Publication:1762109
DOI10.1016/j.cor.2010.12.007zbMath1251.90179OpenAlexW2053614986MaRDI QIDQ1762109
Mohamed Ali Rakrouki, Talel Ladhari, Vincent T'kindt
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.007
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
A single machine scheduling problem with two-dimensional vector packing constraints ⋮ A hybrid heuristic approach for single machine scheduling with release times ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
Uses Software
Cites Work
- Unnamed Item
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- Hybridizing exact methods and metaheuristics: a taxonomy
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Efficient heuristics to minimize total flow time with release dates
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
- The noising method: A new method for combinatorial optimization
- Unrelated parallel machine scheduling using local search
- Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- An iterative heuristic for the single machine dynamic total completion time scheduling problem
- Dominance-based heuristics for one-machine total cost scheduling problems
- Revisiting branch and bound search strategies for machine scheduling problems
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Hybrid Metaheuristics: An Introduction
- Hybridizations of Metaheuristics With Branch & Bound Derivates
- Effective heuristics for the single machine sequencing problem with ready times
- The Single Machine Early/Tardy Problem
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Minimizing maximum lateness on one machine: computational experience and some applications
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- A branch-and-bound-based local search method for the flow shop problem
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
This page was built for publication: 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
