Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
type: Item
instance of: scholarly article
title: Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
zbMATH Open document ID: 1163.90512
author: Débora P. Ronconi
author: Francis Sourd
author: Celso Satoshi Sakuraba
published in: Computers \& Operations Research
publication date: 2008-10-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5349734
zbMATH Keywords: scheduling
zbMATH Keywords: earliness and tardiness
zbMATH Keywords: common due date
zbMATH Keywords: flowshop
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2007.07.005
OpenAlex ID: W2069503245
cites work: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
cites work: Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Minimizing the average deviation of job completion times about a common due date
cites work: Minimizing mean absolute deviation of completion times about a common due date
cites work: Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
cites work: Minimizing total tardiness in permutation flowshops
cites work: Comparative evaluation of MILP flowshop models
cites work: An improved earliness--tardiness timing algorithm
cites work: PERT scheduling with convex cost functions.
cites work: Benchmarks for basic scheduling problems
cites work: On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
cites work: Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
DOI: 10.1016/J.COR.2007.07.005
Recommended article: Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
Recommended article: Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
Recommended article: Minmax due-date assignment on a two-machine flowshop
Recommended article: Two-machine flow shop scheduling with a common due date to maximize total early work
Recommended article: Two-machine flowshop scheduling to minimize mean flow time
Recommended article: Two-machine flowshop scheduling to minimize total tardiness
Recommended article: Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
Recommended article: Single-machine scheduling to minimize absolute deviation of completion times from a common due date
Recommended article: Two-machine flow shop scheduling problems with minimal and maximal delays
Recommended article: Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
description: scientific article; zbMATH DE number 5349734