A dynamic programming method for single machine scheduling
type: Item
instance of: scholarly article
title: A dynamic programming method for single machine scheduling
zbMATH Open document ID: 0806.90064
DOI: 10.1016/0377-2217(94)90007-8
author: Yuichi Nakamura
author: Toshihide Ibaraki
published in: European Journal of Operational Research
publication date: 1994-08-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 622598
zbMATH Keywords: state-space relaxation
zbMATH Keywords: successive sublimation dynamic programming
zbMATH Keywords: single machine scheduling
zbMATH Keywords: weighted sums of earliness and tardiness
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90007-8
OpenAlex ID: W2032786752
cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: Minimization of unsmooth functionals
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: Minimizing Total Costs in One-Machine Scheduling
description: scientific article; zbMATH DE number 622598