Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

Authors:
Celso S. Sakuraba;Débora P. Ronconi;Francis Sourd
Affiliations:
Departamento de Engenharia de Produção, EPUSP, Universidade de São Paulo, Av. Prof. Almeida Prado, 128, Cidade Universitária, 05508-900, São Paulo SP, Brazil;Departamento de Engenharia de Produção, EPUSP, Universidade de São Paulo, Av. Prof. Almeida Prado, 128, Cidade Universitária, 05508-900, São Paulo SP, Brazil;Lab. LIP6, Université Pierre et Marie Curie, Case Courier 169, 4, Place Jussieu, 75252 Paris, Cedex 05, France
Venue:
Computers and Operations Research
Year:
2009

Citing 7
Cited 1

Sequencing with earliness and tardiness penalties: a review

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

Computers and Operations Research
Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
PERT scheduling with convex cost functions

Theoretical Computer Science
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties

Computers and Operations Research
An improved earliness-tardiness timing algorithm

Computers and Operations Research

Setting a common due date in a constrained flowshop: A variable neighbourhood search approach

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. We present heuristics that use an algorithm, based on proposed properties, which obtains an optimal schedule for a given job sequence. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. Computational experiments show that the developed heuristics outperform results found in the literature for problems up to 500 jobs.