A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
type: Item
instance of: scholarly article
title: A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
zbMATH Open document ID: 1179.90139
author: Gio K. Kao
author: E. C. Sewell
author: Sheldon H. Jacobson
published in: Journal of Scheduling
publication date: 2009-09-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5607419
zbMATH Keywords: branch and bound algorithms
zbMATH Keywords: scheduling theory and algorithms
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: s10951-008-0087-3
OpenAlex ID: W2049813155
cites work: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
cites work: A branch and bound to minimize the number of late jobs on a single machine with release time constraints
cites work: A new tabu search procedure for an audit-scheduling problem
cites work: On decomposition of the total tardiness problem
cites work: Q3993992
cites work: Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
cites work: An exact method to minimize the number of tardy jobs in single machine scheduling
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: Q5675139
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4124332
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: Q4843187
cites work: Solution of the single machine total tardiness problem
cites work: Algorithmic paradoxes of the single-machine total tardiness problem
DOI: 10.1007/S10951-008-0087-3
description: scientific article; zbMATH DE number 5607419