A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
type: Item
instance of: scholarly article
title: A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
zbMATH Open document ID: 1258.90043
author: E. C. Sewell
author: Jason J. Sauppe
author: David R. Morrison
author: Gio K. Kao
author: Sheldon H. Jacobson
published in: Journal of Global Optimization
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6121320
zbMATH Keywords: dynamic programming
zbMATH Keywords: dominance rules
MaRDI profile type: Publication
full work available at URL: s10898-011-9793-z
OpenAlex ID: W2048656230
cites work: A survey of scheduling problems with setup times or costs
cites work: A new tabu search procedure for an audit-scheduling problem
cites work: On decomposition of the total tardiness problem
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
cites work: Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
cites work: Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Algorithms for single machine total tardiness scheduling with sequence dependent setups
cites work: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
cites work: A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
cites work: Q4124332
cites work: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
cites work: A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
cites work: A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
cites work: Some dominance properties for single-machine tardiness problems with sequence-dependent setup
cites work: Branch-and-Bound Strategies for Dynamic Programming
cites work: Q3212909
cites work: Q4864690
cites work: Handbook of applied optimization
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: Scheduling in a sequence dependent setup environment with genetic search
cites work: Solution of the single machine total tardiness problem
DOI: 10.1007/S10898-011-9793-Z
description: scientific article; zbMATH DE number 6121320