An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
type: Item
instance of: scholarly article
title: An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
zbMATH Open document ID: 0842.90067
DOI: 10.1016/0167-6377(95)00006-6
author: Jose A. Ventura
author: Michael X. Weng
published in: Operations Research Letters
publication date: 1996-02-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 834654
zbMATH Keywords: mean absolute deviation
zbMATH Keywords: mean earliness and tardiness
zbMATH Keywords: single machine
zbMATH Keywords: common due date
MaRDI profile type: Publication
full work available at URL: 0167-6377(95)00006-6
OpenAlex ID: W2021019029
cites work: Minimizing mean absolute deviation of completion times about a common due date
cites work: Q4198056
cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
cites work: Scheduling around a small common due date
cites work: Minimizing the average deviation of job completion times about a common due date
Wikidata QID: Q127352544
description: scientific article; zbMATH DE number 834654