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 (Q1762109): Difference between revisions

Latest revision as of 21:07, 5 July 2024

scientific article

Language	Label	Description	Also known as
English	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	scientific article

Statements

instance of

scholarly article

0 references

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 (English)

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

15 November 2012

0 references

zbMATH Keywords

single machine

0 references

release dates

0 references

heuristics

0 references

genetic local search

0 references

genetic recovering beam search

0 references

describes a project that uses

Beam-ACO

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2010.12.007

0 references

cites work

Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling

0 references

Hybridizations of Metaheuristics With Branch & Bound Derivates

0 references

Hybrid Metaheuristics: An Introduction

0 references

Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm

0 references

An iterative heuristic for the single machine dynamic total completion time scheduling problem

0 references

Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates

0 references

The noising method: A new method for combinatorial optimization

0 references

Efficient heuristics to minimize total flow time with release dates

0 references

Q4017560

0 references

Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP

0 references

Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs

0 references

A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem

0 references

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

0 references

A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

0 references

A branch-and-bound-based local search method for the flow shop problem

0 references

An algorithm for single machine sequencing with release dates to minimize total weighted completion time

0 references

A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates

0 references

Dominance-based heuristics for one-machine total cost scheduling problems

0 references

Hybridizing exact methods and metaheuristics: a taxonomy

0 references

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

0 references

Effective heuristics for the single machine sequencing problem with ready times

0 references

The Single Machine Early/Tardy Problem

0 references

Minimizing maximum lateness on one machine: computational experience and some applications

0 references

New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling

0 references

Revisiting branch and bound search strategies for machine scheduling problems

0 references

A hybrid genetic local search algorithm for the permutation flowshop scheduling problem

0 references

Identifiers

zbMATH Open document ID

1251.90179

0 references

DOI

10.1016/j.cor.2010.12.007

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1762109

@@ Property / describes a project that uses @@
+Beam-ACO
@@ Property / describes a project that uses: Beam-ACO / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2010.12.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2053614986
@@ Property / OpenAlex ID: W2053614986 / rank @@
+Normal rank
@@ Property / cites work @@
+Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
+Normal rank
@@ Property / cites work @@
+Hybridizations of Metaheuristics With Branch &amp; Bound Derivates
+Normal rank
@@ Property / cites work @@
+Hybrid Metaheuristics: An Introduction
@@ Property / cites work: Hybrid Metaheuristics: An Introduction / rank @@
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
+Normal rank
@@ Property / cites work @@
+An iterative heuristic for the single machine dynamic total completion time scheduling problem
+Normal rank
@@ Property / cites work @@
+Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
+Normal rank
@@ Property / cites work @@
+The noising method: A new method for combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Efficient heuristics to minimize total flow time with release dates
+Normal rank
@@ Property / cites work @@
+Q4017560
@@ Property / cites work: Q4017560 / rank @@
+Normal rank
@@ Property / cites work @@
+Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
+Normal rank
@@ Property / cites work @@
+Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
+Normal rank
@@ Property / cites work @@
+A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
+Normal rank
@@ Property / cites work @@
+Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Unrelated parallel machine scheduling using local search
+Normal rank
@@ Property / cites work @@
+A branch-and-bound-based local search method for the flow shop problem
+Normal rank
@@ Property / cites work @@
+An algorithm for single machine sequencing with release dates to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
+Normal rank
@@ Property / cites work @@
+Dominance-based heuristics for one-machine total cost scheduling problems
+Normal rank
@@ Property / cites work @@
+Hybridizing exact methods and metaheuristics: a taxonomy
+Normal rank
@@ Property / cites work @@
+Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
+Normal rank
@@ Property / cites work @@
+Effective heuristics for the single machine sequencing problem with ready times
+Normal rank
@@ Property / cites work @@
+The Single Machine Early/Tardy Problem
@@ Property / cites work: The Single Machine Early/Tardy Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing maximum lateness on one machine: computational experience and some applications
+Normal rank
@@ Property / cites work @@
+New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Revisiting branch and bound search strategies for machine scheduling problems
+Normal rank
@@ Property / cites work @@
+A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
+Normal rank