Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
type: Item
instance of: scholarly article
title: Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
zbMATH Open document ID: 1098.90031
author: Frank Werner
author: Volker Lauff
published in: Mathematical and Computer Modelling
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 2137157
zbMATH Keywords: Multimachine scheduling
zbMATH Keywords: Common due date
zbMATH Keywords: Earliness-tardiness penalties
zbMATH Keywords: Nonregular criteria
MaRDI profile type: Publication
full work available at URL: j.mcm.2003.05.019
OpenAlex ID: W1980904333
Wikidata QID: Q57633933
cites work: Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Minimizing the average deviation of job completion times about a common due date
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
cites work: The complexity of scheduling job families about a common due date
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Single- and multiple-processor models for minimizing completion time variance
cites work: Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
cites work: Q3793928
cites work: Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
cites work: Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
cites work: Minmax earliness-tardiness costs with unit processing time jobs
cites work: Parallel machine earliness and tardiness scheduling with proportional weights
cites work: Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
cites work: Equivalence of mean flow time problems and mean absolute deviation problems
cites work: Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
cites work: Q2712366
cites work: Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
cites work: An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
cites work: Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
DBLP publication ID: journals/mcm/LauffW04
DOI: 10.1016/J.MCM.2003.05.019
description: scientific article; zbMATH DE number 2137157