\textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
type: Item
instance of: scholarly article
title: \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
author: Lei Shang
author: Vincent T'kindt
author: F. Della Croce
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350560
zbMATH Keywords: scheduling
zbMATH Keywords: exact algorithms
zbMATH Keywords: memorization
zbMATH Keywords: branch and memorize
zbMATH Keywords: sequencing
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105171
OpenAlex ID: W3120141628
cites work: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
cites work: Q5503674
cites work: The one-machine sequencing problem
cites work: Q4017560
cites work: Resolution search
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: Exact exponential algorithms.
cites work: An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Expected Computation Time for Hamiltonian Path problem
cites work: Resolution search and dynamic branch-and-bound
cites work: Scheduling around a small common due date
cites work: Q4821818
cites work: A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
cites work: The single-machine total tardiness scheduling problem: review and extensions
cites work: Q4124332
cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
cites work: An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
cites work: Minimizing Weighted Completion Times with Deadlines
cites work: Generalized resolution search
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
cites work: Algorithms for maximum independent sets
cites work: A branch, bound, and remember algorithm for the simple assembly line balancing problem
cites work: A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
cites work: Solution of the single machine total tardiness problem
cites work: Algorithmic paradoxes of the single-machine total tardiness problem
cites work: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
cites work: An exact algorithm for single-machine scheduling without machine idle time
cites work: Revisiting branch and bound search strategies for machine scheduling problems
cites work: Exact algorithms for maximum independent set
cites work: Exact algorithms for maximum induced matching
DOI: 10.1016/J.COR.2020.105171
description: scientific article; zbMATH DE number 7350560